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 Go (1.14.1) (judge verdict: Wrong Answer)

package main

import (
	"fmt"
	"strings"
)

func intmin() func(int) int {
	isFirst := true
	min := 0
	return func(a int) int {
		if isFirst {
			isFirst = false
			min = a
			return a
		}
		if min > a {

			return a
		}
		return min
	}
}
func main() {
	var S, T string
	fmt.Scan(&S, &T)

	s := strings.Split(S, "")
	t := strings.Split(T, "")

	count := 0
	min := 0
	isFirst := true

	for offset := 0; offset < len(S)-len(T); offset++ {

		for i := 0; i < len(T); i++ {

			if s[offset+i] != t[i] {
				count++
			}

		}

		min = func(a int) int {
			if isFirst {
				isFirst = false
				return a
			}
			if min > a {
				return a
			}
			return min
		}(count)

		count = 0

	}
	fmt.Println(min)

}