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)

//-fexec-charset=CP932
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MAX 100
#define THOU 1000
#define FIVEMAX 100000
#define NINEMAX 1000000000
#define TWEMAX 1000000000000
#define rep(i,n) for (int i=0;i<n;i++)
#define drep(i,n) for(int i=n-1;i>=0;i--)
#define arep(i,a,n) for(int i=a;i<n;i++)
#define darep(i,a,n) for(int i=n,i>=a;i--)
 
 
 
int main(){
 cin.tie(0);
 ios::sync_with_stdio(false);
 string s,t;
 vector<int>v;
 map<string,int>m;
 pair<int,int>p;

 int n=1000;
 cin>>s>>t;
 
 size_t sizes=s.length();
 size_t sizet=t.length();
 int ans=sizet,flag=0;
 rep(i,sizes){
     rep(j,sizet){
     if(s[i+j]==t[j]){
         ans--;
        if((i+j)==(sizes-1))flag=1;
     }
     
     if(flag==1)break;
     }
 }

 
cout<<ans<<endl;
return 0;
}