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

#define rep(i, n) for (int i = 0; i < n; i = i + 1)
#define array(N, t) (t*)calloc(N, sizeof(t))
#define ll long long
#define INF ((1LL << 62) - (1LL << 31))
#define max(p, q)((p) > (q) ? (p) : (q))
#define min(p, q)((p) < (q) ? (p) : (q))

char S[1010], T[1010];

int solve() {
  int ans = 1e9;
  int slen = strlen(S);
  int tlen = strlen(T);

  int diff = slen - tlen;

  // printf("diff: %d\n", diff);
  if (diff == 0) {
    return slen;
  }

  rep(i, diff) {
    int cnt = 0;
    // printf("i: %d\n", i);
    rep(j, tlen) {
      int k = i + j;
      // printf("j: %d\n", j);
      // printf("k: %d\n", k);
      if (S[k] != T[j]) {
        cnt += 1;
      }
    }
    ans = min(ans, cnt);
  }
  return ans;
}

int main() {
  scanf("%s", S);
  scanf("%s", T);

  printf("%d\n", solve());

  return 0;
}