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 Java (OpenJDK 11.0.6) (judge verdict: Wrong Answer)

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String allStr = sc.next();
        String shortStr = sc.next();
        int changeCount = shortStr.length();
        //減らす文字数を増やしながら部分一致を探していく
        for(int i=0; i<shortStr.length(); i++) {
            for(int j=shortStr.length(); j>1; j--) {
                if(i>=j) {
                    continue;
                }
                String s = shortStr.substring(i, j);
                int index = allStr.indexOf(s);
                if(index!=-1) {
                    int count = shortStr.length() - (j-i);
                    int lastcount = allStr.length() - index + shortStr.length();
                    //前後の文字数が足りるか確認
                    if(index >= i && lastcount>=0) {
                        //変更数が小さい方を保存
                            if(changeCount > count) {
                                changeCount = count;
                            }
                        }
                }
            }
        }
        System.out.println(changeCount);
    }
}