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 (Clang 10.0.0) (judge verdict: Accepted)

#include<stdio.h>
int main(){
  int i,j,count,ans,lenght_t,lenght_s;
  char s[1000],t[1000];

  for(i=0;s[i-1]!='\n';i++){
    scanf("%c",&s[i]);
  }
  lenght_s = i-1;
  for(i=0;t[i-1]!='\n';i++){
    scanf("%c",&t[i]);
  }
  lenght_t = i-1;

  ans = lenght_t;

  for(i=0;i<=lenght_s - lenght_t;i++){
    count = 0;
    for(j=0;j<lenght_t;j++){
      if( t[j] != s[i+j] ){
        count++;
      }
    }
    if(count < ans) ans = count;
  }

  if(count < ans){
    printf("%d\n",count);
  }else{
    printf("%d\n",ans);
  }

  return 0;
}