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)

// In the nAme Of Allah
#include<bits/stdc++.h>
#define pb push_back
#define ins insert
#define f first
#define pp pop_back
#define ll long long int
#define fst  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
string s,t;
priority_queue<int> pq;
int main()
{
   fst;
   int p=0,l=0;
  cin>>s>>t;
  if(s.size()==t.size())
  {
      for(int i=0;i<s.size();i++)
      {
          if(s[i]==t[i])
            p++;
      }
      cout<<s.size()-p;
  }
  else{
  for(int i=t.size()-1;i<s.size();i++)
  {
     for(int j=i-t.size()-1;j<=i;j++)
     {
         if(t[j]==s[l])
         {
   p++;
         }
         l++;
             }
             l=0;
             pq.push(p);
             p=0;
  }
  cout<<t.size()-pq.top();
  }
   return 0;
}