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"
	"math"
	"strings"
)

func main() {
	// Code for B - Substring
	var S, T string
	fmt.Scanf("%s", &S)
	fmt.Scanf("%s", &T)

	var num1 int
	var flag int = 0
	for i := 0; i < len(T); i++ {
		A := strings.Index(S, T[0:len(T)-i])
		if A != -1 && len(S) >= A+len(T) {
			//fmt.Println("test 1")
			num1 = i
			flag = 1
			break
		}
	}

	var num2 int
	for i := 0; i < len(T); i++ {
		B := strings.Index(S, T[i:len(T)])
		if B != -1 && B+1 >= len(T) {
			//fmt.Println(B, len(T), T[i:len(T)], i)
			num2 = i
			flag = 1
			break
		}
	}

	if flag == 0 {
		fmt.Println(len(T))
	} else {
		if num1 == 0 {
			fmt.Println(num2)
		} else if num2 == 0 {
			fmt.Println(num1)
		} else {
			C := int(math.Min(float64(num1), float64(num2)))
			fmt.Println(C)
		}
	}
}