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: Wrong Answer)

#
# 177B
#
import sys

s = input()
t = input()

i = 0
tl = t
while i<len(t):
    if t[0:(len(t)-i)] in s:
        tl = t[0:(len(t)-i)]
        #print(tl)
        break
    i += 1

l = len(t)-len(tl)

#print("==================")

i = 0
tr = t
#print("start tr:"+tr)
while i<len(t):
    if t[i:len(t)] in s:
        tr = t[i:(len(t))]
        #print("i:"+str(i)+"  tr:"+tr)
        break
    i += 1
#print("result tr:"+tr)

r = len(t)-len(tr)

#print("l:"+str(l))
#print("r:"+str(r))

if l==0 and r==0:
    print(len(t))
    sys.exit()

if l==0:
    print(r)
    sys.exit()
elif r==0:
    print(l)
    sys.exit()

if l>r :
    print(str(r))
else:
    print(str(l))