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# (Mono-mcs 6.8.0.105) (judge verdict: Wrong Answer)

using System;
using System.IO;
using System.Linq;
using System.Collections.Generic;

namespace CSharp_Shell
{

    public static class Program 
    {
        public static void Main() 
        {
          string S = Console.ReadLine();
          string[] T = Console.ReadLine().Select(x => x.ToString()).ToArray();
          int min = 0;
          string search = "";
          for(int i = 0; i < T.Length; i++){
            search += T[i].ToString();
            int index1 = S.IndexOf(search);
            int index2 = S.IndexOf(T[i].ToString());
            if(index1 > -1 && index1 >= i){
            	min = Math.Max(search.Length, min);
            }else if(index2 > -1 && index2 >= i){
            	min = Math.Max(1,min);
            }
          }
          Console.WriteLine(T.Length - min);
        }
    }
}