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 1.8.0) (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();

		if(S.contains(T))
		{
			System.out.println(0);
		}
		else
		{
			char[] sArray = S.toCharArray();
			char[] tArray = T.toCharArray();

			int lengthDiff = S.length()-T.length() + 1;
			//System.out.println(String.format("lengthDiff = {0}", S.length()-T.length()));

			int maxSameCharCount = 0;

			for(int i=0; i<lengthDiff;i++)
			{
				int sameCharCounter=0;
				for(int j=0; j<tArray.length;j++)
				{
					//System.out.println("sArray[i+j]" + sArray[i+j]);
					//System.out.println("tArray[j]" + tArray[j]);

					if(sArray[i+j] == tArray[j]) sameCharCounter++;
				}

				if(maxSameCharCount < sameCharCounter)
				{
					maxSameCharCount = sameCharCounter;
				}
				//System.out.println();
			}

			System.out.println(T.length()-maxSameCharCount);
		}
	}
}