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 abc177_b():
    """
    シンプルに全探索でよい、ということだそうだよ。
    探索はsのほうに対して、インデックスをずらしながら何文字が一致するかを。
    """
    s = input()
    t = input()

    # 最大値はt文字分すべて置き換えが必要な場合
    ans = len(t)

    for i in range(len(s) - len(t) + 1):
        cnt = 0
        # s[i]からスタートして、tと何文字一致しない場所を数える(書き換えが必要な場所)
        for _s, _t in zip(s[i:], t):
            if _s != _t:
                cnt += 1

        ans = min(ans, cnt)

    print(ans)
   
if __name__ == '__main__':
    abc177_b()