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 s = sc.next();
    String t = sc.next();
    // System.out.println();
    int count = 0;
    for(int i=t.length() ; i>0 ; i--){
      for(int j=0 ; j<s.length()-i+1 ; j++){
        String ss = s.substring(j,j+i);
        String tt = t.substring(0,i);
        // System.out.println(ss);
        // System.out.println(tt);
        // System.out.println();
        if(ss.equals(tt)){
          count = ss.length();
          break;
        }
      }
    }

    System.out.println(t.length()-count-1);
  }
}