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<bits/stdc++.h>
using namespace std;
#define ll long long 
void pk()
{
    string s,t;
    cin>>s>>t;
    ll n=s.size();
    ll m=t.size();
    ll mi=INT64_MAX;
    for(ll i=0;i<=n-m+1;i++)
    {
        string temp;
        for(ll j=i;j<i+m;j++)
        {
            temp+=s[j];
        }
        ll cn=0;
            for(ll h=0;h<temp.size();h++)
            {
                if(t[h]!=temp[h])
                  cn++;
            }
        mi=min(mi,cn);
    }
    cout<<mi;
}
int main()
{
    ios_base::sync_with_stdio(false);
	cin.tie(NULL);
    //a #ifndef ONLINE_JUDGE 
    // freopen("/home/priyanshu/Hackercup/input.txt", "r", stdin); 
    // freopen("/home/priyanshu/Hackercup/output.txt", "w", stdout); 
    // #endif 
	ll t=1;
   // cin>>t;
    while(t--)
    {
        pk();
    }
}