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 <bits/stdc++.h>
using namespace std;
 
int main() {
  string S,T;
  int num,count=0,count_2=0;
  
  cin >> S;
  cin >> T;
  
  num = int(S.size()) - int(T.size()) + 1;
  
  for(int i=0;i<num;i++){
    count_2 = 0;
  	for(int j=0;j<int(T.size());j++){
      if(T.at(j) != S.at(i+j)){
        count_2 += 1;
      }  
    } 
    if(i==0){
      count = count_2;
    }
    if((i != 0) and (count_2 < count)){
      count = count_2;
    }
  }
  
  cout << count << endl;
  
}