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)

//
//  main.c
//  q_02
//
//  Created by k19104kk on 2020/08/29.
//  Copyright © 2020 AIT. All rights reserved.
//

#include <stdio.h>

int main(int argc, const char * argv[]) {
    char s[1001], t[1001];
    scanf("%s", s);
    scanf("%s", t);
    
    int i=0, j=0, maxcnt=0, input_t = 0;
    
    while (s[i] != '\0') {
        int cnt=0;
        while (t[j] != '\0') {
            if (s[i+j] == t[j]) {
                cnt++;
            }
            j++;
        }
        input_t = j;
        j=0;
        if (cnt>maxcnt) {
            maxcnt = cnt;
        }
        i++;
    }
    
    printf("%d\n", input_t-maxcnt);
    return 0;
}