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[1001], T[1001];
	int i,j,k, t=0,l,tmax=0,Ssize,Tsize;
	scanf("%s", S,1001);
	scanf("%s", T,1001);
	Ssize = strlen(S);
	Tsize = strlen(T);
	for (i = 0; i < Ssize; i++)
	{

		for (j = 0; j < Tsize; j++)
		{
			if (j > i)
			{
				break;
			}
			
			if (S[i]==T[j])
			{
				k = i;
				l = j;
				while (S[k] == T[l])
				{

					k++;
					l++;
					t++;
					if (t == Tsize)
					{
						tmax = Tsize;
						t = 0;
						break;
					}
					if (l == Tsize||k==Ssize)
					{
						break;
					}
				}
			}
			if (t > tmax)
			{
				tmax = t;
			}
			t = 0;
			if (tmax == Tsize)
			{
				break;
			}
		}
		if (tmax == Tsize)
		{
			break;
		}
		
	}
	int ans;
	ans = Tsize - tmax;
	printf("%d", ans);
	return 0;
}