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: Accepted)

#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>

using namespace std;
int ans;
string s1,s2;

int main()
{
	int i,j,l1,l2,f=0;
	cin>>s1>>s2;
	if(s1==s2)
	{
		printf("0\n");
		return 0;
	}
	l1=s1.size(),l2=s2.size();
	ans=l2;
	for(i=0;i<l1-l2+1;i++)
	{
		int sum=0;
		string ts=s1.substr(i,l2);
		if(ts==s2)
		{
			printf("0\n");
			return 0;
		}
		for(j=0;j<l2;j++)
		{
			if(sum>=ans) break;
			if(ts[j]!=s2[j]) sum++;
		}
		if(sum) ans=min(ans,sum);
	}
	printf("%d\n",ans);
	return 0;
}