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.Map.Entry;
import java.lang.reflect.Method;
import java.util.*;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.Deque;
import java.util.ArrayList;

//import org.w3c.dom.css.Counter;

public class Main {
    // public class App {

    public static void main(final String[] args)throws Exception{
        //BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        final Scanner s = new Scanner(System.in);
        String S = s.next();
        String T =s.next();
        int hoge = T.length();
        int ans = hoge;
        //T開始地点
        for(int i =0; i<hoge;i++){
            //T終了地点
            for(int i2 = hoge;i2-i >= 1 ;i2--){
                //検索対象文字
                String huge = T.substring(i,i2);
                //開始地点と、終了地点前後の文字を考慮する
                String Snew = S.substring(i,S.length()-(hoge-i2));
                if(Snew.contains(huge)&& ans > hoge - huge.length()){
                    ans = hoge - huge.length();
                }
            }
        }
                System.out.println(ans);
        
    }
}