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: Runtime Error)

import java.util.Scanner;

/**
 *
 * @author joeco
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        
        Scanner in = new Scanner(System.in);
        String s  = in.next();
        String t  = in.next();
        
        
        int res = t.length()-overlaps(s, t);
        System.out.println(res);
        
    }
    
    public static int overlaps(String s, String t) {
        int res = 0;
        for(int i = 0; i < t.length(); i++) {
            if(t.charAt(i)==(s.charAt(i))) res++;
        }
        
        int res2 = 999999;
        if(t.length() >= s.length()-1) res2=overlaps(s.substring(1), t);
        
        return (res<res2) ? res : res2;
    }
    
    
    
}