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 c++ libraries */
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <unordered_map>
#include <map>
#include <queue>
#include <set>

/* include c-lang libraries */
#include <climits>
#include <cmath>

/* include my libraries */
//#include <show_vec.hh>

using namespace std;

#define LINE DEBUG{ printf("LINE : %d\n", __LINE__); }
#define DEBUG if(false)

using ll = long long;
template<class T> using vec = vector<T>;

const int MOD = 1000000007;

int main(){
  string S, T;
  cin >> S;
  cin >> T;
  int Tlength = T.length();
  int max_match_length = 0;

  for(int lenT = 1; lenT <= Tlength; lenT++){
    // Tの部分文字列の長さ : lenT
    for(int left_T = 0; left_T < Tlength-lenT; left_T++){
      // 部分文字列 left_TからlenT文字分


      for(int iS = left_T; iS < S.length() - left_T; iS++){
        // iS : Sの左端

        // チェックフェーズ
        bool boolean = true;
        for(int i = 0; i < lenT; i++){
          if(S[iS + i] != T[left_T + i]){
            boolean = false;
            break;
          }else{
            continue;
          }
        }

        if(boolean){
          goto LEN_PP;
        }

      }
    }

    break;

    LEN_PP:
      max_match_length = lenT;
      continue;


  }

  cout << Tlength-max_match_length << endl;



  return 0;
}