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>
#include <stdlib.h>
#include <string.h>

int main(void) {
	char s[1024], t[1024];
	int i, j, max, cnt;

	fgets(s, sizeof(s), stdin);
	fgets(t, sizeof(t), stdin);

	for ( i = 0; i < strlen(s); i++ ) {
		if ( s[i] == '\n' || s[i] == '\r' ) {
			s[i] = '\0';
		}
	}
	for ( i = 0; i < strlen(t); i++ ) {
		if ( t[i] == '\n' || t[i] == '\r' ) {
			t[i] = '\0';
		}
	}

	max = 0;
	for ( i = 0; i <= (strlen(s) - strlen(t)); i++ ) {
		cnt = 0;
		
		for ( j = 0; j < strlen(t); j++ ) {
			if ( s[i+j] == t[j] ) {
				cnt++;
			}
			//printf("%c == %c : cnt = %d\n", s[i+j], t[j], cnt);
		}
		if ( max < cnt ) {
			max = cnt;
		}
	}

	printf("%lu\n", strlen(t) - max);

	return 0;
}