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: Accepted)

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[] sAry = new char[s.length()];
      char[] tAry = new char[t.length()];

      for(int i=0; i < sAry.length; ++i) sAry[i] = s.charAt(i);
      for(int i=0; i < tAry.length; ++i) tAry[i] = t.charAt(i);

      // 解くよ！
      int ans = 1001;

      // 比較開始位置のfor文（1文字目～S-T+1文字目まで)
      // 注意：この"文字目"は問題文が示す文字数。添え字ではない。
      for(int i=0; i <= sAry.length - tAry.length; ++i) {
        int answk = 0;

        // T文字分比較するよ
        for(int j=0; j<tAry.length; ++j) {
          if(sAry[i+j] != tAry[j]) ++answk;
        }

        if(answk < ans) ans = answk;

      }

      if(ans == 1001) ans = 0;

      System.out.println(ans);

    }
}