Problem:
Score : 200 points

Problem Statement

Given are two strings S and T.

Let us change some of the characters in S so that T will be a substring of S.

At least how many characters do we need to change?

Here, a substring is a consecutive subsequence. For example, xxx is a substring of yxxxy, but not a substring of xxyxx.

Constraints

The lengths of S and T are each at least 1 and at most 1000.

The length of T is at most that of S.

S and T consist of lowercase English letters.

Input

Input is given from Standard Input in the following format:

S
T

Output

Print the minimum number of characters in S that need to be changed.

Sample Input 1

cabacc
abc

Sample Output 1

1

For example, changing the fourth character a in S to c will match the second through fourth characters in S to T.

Since S itself does not have T as its substring, this number of changes - one - is the minimum needed.

Sample Input 2

codeforces
atcoder

Sample Output 2

6

Solution in JavaScript (Node.js 12.16.1) (judge verdict: Wrong Answer)

"use strict";
    
const main = arg => {
    arg = arg.trim().split("\n");
    const S = (arg[0]);
    const T = (arg[1].split(""));
    
    let answer = T.length;
    
    for(let i=0; i<T.length; i++) {
        let t = T[i];
        
        for(let j=i; j<S.length; j++) {
            let s = S[j];
            let temp = 0;

            if(t === s) {
                temp++;
                let cnt = 1;
                
                // console.log("一致！");
                // console.log(i + "番目の:" + t);
                // console.log(j + "番目の:" + s);
                
                while(i + cnt <= S.length && j + cnt <=T.length) {
                    if(T[i+cnt] === S[j+cnt]) {
                        temp++;
                        // console.log("その次も一致");
                    } else {
                        break;
                    }
                    
                    cnt++;
                }
            }
            
            // console.log("temp:" + temp);
            // console.log("-----")
            answer = Math.min(T.length - temp, answer);
        }
    }
    
    // for(let i=0; i<T.length; i++) {
    //     for(let j=i; j<T.length+1; j++) {
    //         const t = T.slice(i, j);
 
    //         console.log(S.indexOf(t.join("")));
            
    //         const indexOf = S.indexOf(t.join(""));
            
    //         if(indexOf > 0 && indexOf > i) {
                
                
    //             answer = Math.min(answer, T.length - t.length);
    //             console.log("T.length:" + T.length)
    //         }
    //         console.log("-------")
    //     }
    // }

    console.log(answer);
}
main(require('fs').readFileSync('/dev/stdin', 'utf8'));