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()
{
    char S[1000], T[1000];
    int i, j;
    int C[1000];
    int lenS, lenT;
    int count=0, ans=0;
    
    scanf("%s %s", S, T);
    lenS = strlen(S);
    lenT = strlen(T);
    //printf("%s %s", S, T);
    //printf("%d %d", lenS, lenT);

    for(i=0;i<lenS;i++){
        for(j=0;i+j<lenT;j++){
            if(S[j]!=T[i+j])
                //printf("%c %c\n", &S[i], &T[i+j]);
                count++;
        }
        C[i]=count;
        //printf("%d\n", count);
    }
    
    for(i=1;i<lenS;i++){
        if(C[i]>C[i-1]){
            ans = C[i];
        }
    }
    
    printf("%d", ans);

    return 0;
}