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 1.8.0) (judge verdict: Runtime Error)

import java.util.Scanner;
public class Main {
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        String S = sc.next();
        String T = sc.next();
    
        char[] s = new char[S.length()];
        char[] t = new char[T.length()];
        int[] ans = new int[S.length() - T.length()];
        int num = 0;
    
        for(int i = 0;i < S.length(); i++){        
           s[i] = S.charAt(i);
        }
        
        for(int i = 0;i < T.length(); i++){        
           t[i] = T.charAt(i);
        }
        
        int h;
        
        for(int i = 0; i < S.length() - T.length(); i++){
            h = i;
            num = 0;
            for(int n = 0 ; n < T.length(); n++){        
                if(S.charAt(h)==T.charAt(n)){
                }else{
                num++;
                }
                h++;
            }
            ans[i] = num;
        }
        
        int min      = ans[0];
        for (int index = 1; index < ans.length; index ++) {
            min = Math.min(min, ans[index]);
        }
        
        System.out.println(min);
    }
}