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 JavaScript (Node.js 12.16.1) (judge verdict: Wrong Answer)

"use strict";

function main(input) {
  input = input.trim().split("\n");
  let ans = 0;
  const line1_arr = input[0].split("");
  const line2_arr = input[1].split("");

  for (let i = 0; i < line1_arr.length; i++) {
    let tmp = 0;
    for (let j = 0; j + i < line2_arr.length; j++) {
      // console.log(line1_arr[j + i], line2_arr[j], i);
      if (line1_arr[j + i] == line2_arr[j]) {
        tmp++;
      }
    }
    // console.log(tmp);
    if (ans < tmp) {
      ans = tmp;
    }
  }
  console.log(line2_arr.length - ans);
}

function numberSort(array) {
  array.sort(f);
  return array;
}

var f = function (a, b) {
  return a - b;
};

main(require("fs").readFileSync("/dev/stdin", "utf-8"));