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 ) throws Exception {
    Scanner sc = new Scanner(System.in);
      String S = sc.nextLine(); //全体文字列
      String T = sc.nextLine(); //部分文字列
      int answer = 0;

      //Tの文字を削る　とりあえず頭から一文字ずつ？？？
      //substringを使う時は前半部分は後半の値を超えないように
      for (int p = 1; p-1 < T.length(); p++) {
        for (int q = 0; q < p; q++) {
            System.out.println(T.substring(q,p));
        }
      }
      //TがSにまるごとふくまれているかチェック
      if(S.contains(T)){
          //含まれている場合
          answer = 0;
      }else{
          //含まれていない場合
          answer = S.length();
      }

      System.out.println(answer);   
  }
}