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.Scanner;
import java.time.Year;
import java.util.Random;
import java.math.*;

public class Main{
    public static void main(String[] args){
        Scanner sc =new Scanner(System.in);
        String s = sc.next();
        String t = sc.next();
        String s2="";
        int s_length = s.length();
        int t_length = t.length();
        int count = 0;
        int max=0;
        for(int i = 0;i<(s_length-t_length+1);i++){
            s2=s.substring(i, t_length+i);
            System.out.println(s2);    
            for(int j=0;j<t_length;j++){
                if(s2.charAt(j)==t.charAt(j)){
                    count++;
                    if(max<count){
                        max = count;
                    }
                }
            }count=0;
        }
    System.out.println(t_length-max);    
    }
}