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 <string.h>

int replacenum(const char*,const char*,const int);
int main(void){
  char s[1100],t[1100],s_length;
  int i,m=1100;
  
  if(scanf("%s",s) == EOF) return 1;
  if(scanf("%s",t) == EOF) return 1;
  
  s_length = strlen(s);
  
  for(i=0;i<s_length;i++){
    //printf("%d\n",replacenum(s,t,i));
    if(replacenum(s,t,i) == -1 || s_length < i+strlen(t)) break;
    if(replacenum(s,t,i) < m){
      m=replacenum(s,t,i);
    }
  }
  
  printf("%d\n",m);
  
  return 0;
}

int replacenum(const char*s, const char*t, const int n){ // Sのn文字目からTとSを比べ何文字違うかを返す
  int i,j,s_length,t_length,cnt=0;
  
  s_length=strlen(s);
  t_length=strlen(t);
  for (i=n,j=0;i<s_length && j<t_length;i++,j++){
    if(t[j] == '\0') break;
    //else if(s[i] == '\0') return -1;
    
    if(s[i] != t[j]) cnt++;
  }
  return cnt;
}