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 Ruby (2.7.1) (judge verdict: Time Limit Exceeded)

def string_diff(a,b)
  num = 0
  a.size.times do |i|
    num += 1 if a[i] != b[i]
  end
  num
end

s = gets.chomp
t = gets.chomp
if s.include?(t)
  puts '0'
  exit
end
ans = t.size
t.split('').each_with_index do |u, i|
  start = i
  finish = s.size - (t.size - i)# + 1
  (start..finish).each do |j|
    num = string_diff(s[j...j+t.length], t[i..-1])
    ans = [ans, num + i].min
  end
end
puts ans