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.Text;
using System.Linq;
using System.Collections;
using System.Collections.Generic;
using static System.Console;
using static System.Math;
namespace atcoder151
{
    public class MainClass
    {
        public static void Main(string[] args)
        {
            new MainClass().Solve(new ConsoleInput(Console.In, ' '));
        }

        public void Solve(ConsoleInput cin)
        {

            string s = cin.Read;

            string t = cin.Read;

            List<int> list = new List<int>();
            //for (int i =0; i < t.Length;i++) {
                list.Add(0);
            //}

            int num;
            for (int i =0; i< s.Length - t.Length + 1; i++) {
                num = 0;
                int change = i;
                for (int j = 0; j< t.Length; j++) {
                    //WriteLine(s[i]);
                    //WriteLine(t[j]);
                    if (s[change] == t[j]) {
                        num++;
                        //WriteLine(num);
                    }
                    //WriteLine("change is " + change);
                    change++;
                }
                change = 0;
                //WriteLine("-----------------");
                list.Add(num);
            }



            int ans;
            if (list.Max() == 0)
            {

                ans = 0;
                WriteLine(ans);
            }
            //WriteLine(list.Max());
            else {
                ans = t.Length - list.Max();
                WriteLine(ans);
            }

            
            //int i = t.Length;
            //int p = 0;
            //while (i < s.Length)
            //{
            //    // パターン末尾に位置を合わせる
            //    p = t.Length - 1;

            //    while (p >= 0 && i < s.Length)
            //    {
            //        if (s[i] == t[p])
            //        {
            //            i--; p--;
            //        }
            //        else
            //        {
            //            break;
            //        }
            //    }
                
            //}




            ////string[] array = Console.ReadLine().Split(' ').ToArray();
            //int n = int.Parse(Console.ReadLine());
            ////Console.WriteLine(n);
            //int[] num_array = cin.ReadIntArray(n);
            //List<int> list = new List<int>();            

            //int min = num_array[0];
            ////WriteLine(min);
            //for (int i =0; i< n; i++) {

            //    if (num_array[i] == min) {  
            //        list.Add(0);
            //    }
            //    else if (num_array[i] > min) {
            //        //list.Add(0);
            //        min = num_array[i];
            //        list.Add(0);
            //    } else if (num_array[i] < min) {
            //        list.Add(min - num_array[i]);
            //    }

            //}

            //WriteLine(list.Sum());
        }
       
        public class ConsoleInput
        {
            //string[] arr;
            //int x;
            //int y;
            //        for (int i = 0; i<n; i++)
            //        {
            //            arr = Console.ReadLine().Split(' ').ToArray();
            //x = int.Parse(arr[0]);
            //y = int.Parse(arr[1]);
            //var power = Math.Sqrt(Math.Pow(x, 2) + Math.Pow(y, 2));
            //            if (power <= d)
            //            {
            //                counter++;
            //            }
            //        }
            private readonly System.IO.TextReader _stream;
            private char _separator = ' ';
            private Queue<string> inputStream;
            public ConsoleInput(System.IO.TextReader stream, char separator = ' ')
            {
                this._separator = separator;
                this._stream = stream;
                inputStream = new Queue<string>();
            }
            public string Read
            {
                get
                {
                    if (inputStream.Count != 0) return inputStream.Dequeue();
                    string[] tmp = _stream.ReadLine().Split(_separator);
                    for (int i = 0; i < tmp.Length; ++i)
                        inputStream.Enqueue(tmp[i]);
                    return inputStream.Dequeue();
                }
            }
            public string ReadLine { get { return _stream.ReadLine(); } }
            public int ReadInt { get { return int.Parse(Read); } }
            public long ReadLong { get { return long.Parse(Read); } }
            public double ReadDouble { get { return double.Parse(Read); } }
            public string[] ReadStrArray(long N) { var ret = new string[N]; for (long i = 0; i < N; ++i) ret[i] = Read; return ret; }
            public int[] ReadIntArray(long N) { var ret = new int[N]; for (long i = 0; i < N; ++i) ret[i] = ReadInt; return ret; }
            public long[] ReadLongArray(long N) { var ret = new long[N]; for (long i = 0; i < N; ++i) ret[i] = ReadLong; return ret; }

        }
    }
}