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.util.Arrays;
import java.util.List;

public class Main {
	public static void main(String[] args) {
	    Scanner sc = new Scanner(System.in);
		String inputS = sc.nextLine();
		String inputT = sc.nextLine();
		boolean isStop = false;;
		// 切り出す長さ
		for (int nagasa=inputT.length(); nagasa>0; nagasa--) {
			// 切り出す頭の位置
			for (int i=0; i+nagasa<=inputT.length(); i++) {
				// 検索する文字列を切り出す
				String targetStr = inputT.substring(i, i+nagasa);
				if (inputS.indexOf(targetStr) > -1
				 && inputS.indexOf(targetStr) >= i
				 && inputS.indexOf(targetStr)+nagasa+(inputT.length()-(i+nagasa)) <= inputS.length()) {
					// 文字列発見
					System.out.println(inputT.length()-nagasa);
					isStop = true;
					break;
				}
			}
			if (isStop) {
				break;
			}
		}
	}
}