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: Wrong Answer)

#include <string.h>
#include <limits.h>
#include <stdio.h>


int main(void) {
	char src[1000], trg[1000];
	int results[1000];
	for (int i = 0; i < 1000; i++) {
		results[i] = INT_MAX;
	}
	fgets(src, 1000, stdin);
	fgets(trg, 1000, stdin);

	size_t tar_len = strlen(trg) - 1;

	for (size_t i = 0; i < strlen(src) - 1; i++) {
		results[i] = 0;
		for (size_t j = 0; j < tar_len; j++) {
			if (*(src + i + j) == *(trg + j)) {
				results[i] += 1;
			}
		}
		results[i] = tar_len - results[i];
	}

	int res = INT_MAX;
	for (int i = 0; i < 1000; i++) {
		if (results[i] < res) {
			res = results[i];
		}
	}

	printf("%d", res);
	return 0;
}