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 (GCC 9.2.1) (judge verdict: Accepted)

#include <stdio.h>

int ft_strlen(char *str)
{
        int len;

        len = 0;
        while (str[len] != '\0')
                len++;
        return (len);
}

int check_chenge_char(char *dest, char *src)
{
        int i;
        int count;

        i = 0;
        count = 0;
        while (dest[i] && src[i])
        {
                if (dest[i] != src[i])
                {
                        count++;
                }
                i++;
        }
        return (count);
}

int main(void)
{
        char    t[1001];
        char    s[1001];
        int             i;
        int             max;
        int             answer;
        int             temp;

        scanf("%s%s", t, s);
        i = 0;
        max = ft_strlen(t) - ft_strlen(s);
        answer = 1001;
        while (i <= max)
        {
                temp = check_chenge_char(&t[i], s);
                if (temp < answer)
                {
                        answer = temp;
                }
                i++;
        }
        printf("%d\n", answer);
        return (0);
}