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>
#define max(a,b) ((a)>(b)?(a):(b))
typedef long long int ll;
#define MOD 1000000007
int main() {
    char s[1001],t[1001];
    scanf("%s",s);
    scanf("%s",t);
    int t_size=0;
    int s_size=0;
    while(t[t_size]!='\0') t_size++;
    while(s[s_size]!='\0') s_size++;
    int max=0;
    for(int i=0;i<t_size;i++) {
      	for (int j=0;j<s_size;j++) {
        	if(s[i]==t[j]) {
            	int count=0;
            	while(s[i+count]==t[j+count]) count++;
              	max=count;
            	i+=count;
            }
        }
    }
    printf("%d",t_size-max);
    return 0;
}