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)

//abc177-b
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <algorithm>
#include <map>
#include <stack>

using namespace std;
typedef long long ll;
string a,b;

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin>>a>>b;
	ll cnt=b.size();
	if (a==b)
	cout<<"0"<<endl;
	else 
	{
		for (ll i=0;i<a.size();i++)
		{
			ll ans=b.size();
			if (i+b.size()<=a.size())
			{
				for (ll j=i;j<i+b.size();j++)
				{
					//cout<<a[j]<<' '<<a[i]<<endl; 
					if (a[j]==b[j-i])
					ans--;
				}
			}
			//cout<<ans<<endl;
			cnt=min(cnt,ans);
		}
		cout<<cnt<<endl;
	}
	return 0;
}