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[1001],t[1001];
    int n=0,max_n=0,max_s,max_t,start;
    scanf("%s%s",s,t);
    for(int a=0;;a++)if(s[a]=='\0'){
        max_s=a;
        break;
    }
    for(int a=0;;a++)if(t[a]=='\0'){
        max_t=a;
        break;
    }
    
    for(int i=0;i<max_s;i++){
        n=0;
        for(int j=0;j<max_t;j++){
            if(max_s-max_t<=i)break;
            if(s[i+j]==t[j])n++;
        }
        if(n>max_n)max_n=n;
    }
    printf("%d",max_t-max_n);
    return 0;
}