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;

public class Main {

	public static void main(String[] args) {

		Scanner scan = new Scanner(System.in);

		//入力値取得
		String S = scan.next();
		String T = scan.next();

		//演算
		int result = 0;
		int coin = 0;
		for (int i = 0; i < T.length(); i++) {
			for (int j = i + 1; j <= T.length(); j++) {
				String part = T.substring(i, j);
				if (S.substring(i, S.length() - T.length() + j).contains(part)) {
					if (coin < part.length()) {
						coin = part.length();
					}
				}
			}
		}

		result = T.length() - coin;

		//結果出力
		System.out.println(result);
	}
}