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 Python (3.8.2) (judge verdict: Accepted)


def match1(str1, str2):
    match_count = 0
    for i in range(len(str1)):
        if str1[i] == str2[i]:
            match_count += 1

    return match_count

S = input()
T = input()

max_match = 0
for i in range(0, len(S) +1 -len(T)):
    subS = S[i:i+len(T)]
    max_match = max(max_match, match1(T, subS))
    if max_match == 0:
        for j in range(len(T)):
            if T[j] == subS[j]:
                max_match = 1

print(len(T)-max_match)