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<stdio.h>
#include<stdlib.h>
#include<string.h>
int main(){
  int unused __attribute__((unused));
  int i, j, k, l, Slen, Tlen, kiten, Tnoatta, dif, cnt = 0;
  char S[1001], T[1001];
  unused = scanf("%s", S);
  unused = scanf("%s", T);

  Slen = strlen(S);
  Tlen = strlen(T);
  dif = Slen - Tlen;
  kiten = -1;
  j = 0;
  while(dif < Slen-1){
    for(i=j; i<dif; i++){
      if((int)S[i]==(int)T[j]){
        kiten = i;
        Tnoatta = j;
        break;
      }
    }
    //printf("kiten:%d Tnoatta:%d cnt:%d\n", kiten, Tnoatta, cnt);
    if(kiten >= 0){
      for(k=kiten; k<Tlen-Tnoatta; k++){
        for(l=Tnoatta; l<Tlen-Tnoatta; l++){
          if((int)S[k]==(int)T[l]) cnt++;
        }
      }
      dif = Slen;
    }else{
      dif++;
      j++;
    }
  }
  if(cnt>0) printf("%d", Tlen-cnt);
  else printf("0");

  return 0;
}