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 C# (.NET Core 3.1.201) (judge verdict: Wrong Answer)

using System;
using System.Collections.Generic;

namespace ABC177_B {
    public class Program {
        public static void Main(string[] args) {
            var sourceStr = Console.ReadLine();
            var targetStr = Console.ReadLine();

            int ans = targetStr.Length;

            for (int index = 0; index < targetStr.Length; index++) {
                for (int splitLength = 1; splitLength <= targetStr.Length - index; splitLength++) {
                    if (ans <= targetStr.Length - splitLength) continue;

                    var splitStr = targetStr.Substring(index, splitLength);
                    if (isExists(splitStr, sourceStr, index, targetStr.Length - (index + splitLength))) {
                        if (ans > targetStr.Length - splitStr.Length) {
                            ans = targetStr.Length - splitStr.Length;
                            
                            if(ans == 1) {
                                Console.WriteLine(ans);
                                return;
                            }
                        }
                    }
                }
            }
            Console.WriteLine(ans);
        }

        private static bool isExists(string splitStr, string sourceStr, int beforeLength, int afterLength) {
            for (int index = 0; index < sourceStr.Length - splitStr.Length; index++) {
                if (splitStr == sourceStr.Substring(index, splitStr.Length)) {
                    if (index < beforeLength) continue;
                    if (sourceStr.Length - (index + splitStr.Length) < afterLength) continue;

                    return true;
                }
            }

            return false;
        }

        private static List<int> parseInputStrForList() {
            var input = Console.ReadLine().Split();
            var list = new List<int>();
            for (int index = 0; index < input.Length; index++) {
                list.Add(int.Parse(input[index]));
            }

            return list;
        }
    }
}