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 (GCC 9.2.1) (judge verdict: Wrong Answer)

#include<stdio.h>

int main(void){
   char S[1000], T[1000];
   scanf("%s",S);
   scanf("%s",T);
   int min = 2000, i = 0, j, k = 0, x = 0,p;
   while(i < 1000){//iを増やす
       if(S[i] < 'a' || S[i] > 'z'){
           break;
       }
        j = i;
        while(j < 1000){//jを増やす
            if(S[j] < 'a' || S[j] > 'z'){
                break;
            }
            p = j;
            while(k < 1000){//kを増やす
                if(T[k] < 'a' || T[k] > 'z'){
                break;
                }
                if(S[j] != T[k]){
                    x++;
                }
                j++;
                k++;
            }
            if(x < min){
                min = x;
            }
            x = 0;
            j == p+1;
            k = 0;
        }
        i++;
   } 
   printf("%d\n", min);
   return 0;
}