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: Runtime Error)

#include <stdio.h>
#include <string.h>

int main()
{
    char S[101],T[101];
    int temp;
    int width;
    int m;
    int n;
    int i,j,k;

    scanf("%s\n",S);
    scanf("%s\n",T);

    m=strlen(T);
    width=strlen(S)-m+1;
    n=1000;

    for(i=0;i<width;i++){
        temp=0;
        for(j=0,k=i;j<m;j++,k++){
            if(S[k]!=T[j]){
                temp++;
            }
        }
        if(temp==0){
            n=temp;
            break;
        }
        if(n>temp){
            n=temp;
        }
    }

    printf("%d\n",n);

    return 0;
}