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>
#include<string.h>
int main(void)
{
    long long int s,t,n,i,j,count = 0,kekka = 1000000000,k;
    char S[1000],T[1000];
    scanf("%s %s",S,T);
    s = strlen(S);
    t = strlen(T);
    for(i = 0 ; i <= s - t + 1 ; i++)
    {
        count = 0;
        for(j = i,k = 0 ; j <= i + t - 1,k < t ; j++,k++)
        {
            if(S[j] != T[k])
            {
                count++;
            }
        }
        
        if(count <= kekka)
        {
            kekka = count;
        }
    }
    printf("%lld\n",kekka);
    return 0;
}