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 C# (.NET Core 3.1.201) (judge verdict: Wrong Answer)

using System;
class Program
 {
   	static void Main(string[] args)
        {
    　　	string S = Console.ReadLine(); //標準入力
		
    　　	string T = Console.ReadLine(); //標準入力
		
      int t_length = T.Length;
      
      int maxlength = 0;
    for(int i = 0; i< t_length; i++){
 	 	for(int j = i; j< t_length; j++){
  			string subs= T.Substring(i, j-i+1);
          	string Ssubs = S.Substring(i,S.Length-i-(t_length-j-1));
          	if(Ssubs.Contains(subs)){
              if(maxlength<j-i+1){
                maxlength = j-i+1;
              }
            }
      	}
      }
		
	
     		Console.WriteLine("{0}", t_length-maxlength);
        }
 
 }