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: Runtime Error)

using System;
using System.Linq;

namespace ConsoleApp3
{
    internal class Class12
    {
        private static void Main(string[] args)
        {
            var s = Console.ReadLine();
            var t = Console.ReadLine();

            var max = s[0..(t.Length - 1)];

            var maxCount = max.Select((x, i) => (x, i)).Count(x => x.x == t[x.i]);
            for (int i = 0; i < s.Length - t.Length + 1; ++i)
            {
                s = s.Substring(1);
                max = s[0..t.Length];
                maxCount = Math.Max(maxCount, max.Select((x, i) => (x, i)).Count(x => x.x == t[x.i]));
            }

            Console.WriteLine(t.Length - maxCount);
        }
    }
}