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 main(){
    char s[1020],t[1020];
    int contador=0,tams,tamt,minimo;

    scanf("%s ",s);
    scanf(" %s",t);

    tams = strlen(s);
    tamt = strlen(t);

    for(int i =0;i<tams - tamt +1;i++){
        contador =0;
        //printf("s[%d]: %c - t[%d]: %c\n", i+j, s[i+j], j, t[j]);
        for(int j=0;j<tamt;j++){

        //    printf("s[%d]: %c - t[%d]: %c\n", i+j, s[i+j], j, t[j]);
          if(s[i+j]!=t[j]){
           contador++;
            }
        }
        if(minimo>contador){
            minimo = contador;
        }
    //    puts("----");
    //    printf("%d\n",contador);
        //if(s[i]!=t[j])
        //    contador++;

    }
    printf("%d\n",minimo);

    return 0;
}