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 Rust (1.42.0) (judge verdict: Accepted)

#![allow(non_snake_case)]
#![allow(unused_imports)]
use proconio::input;
use std::collections::HashMap;
use std::collections::VecDeque;
use std::cmp::max;
use std::cmp::min;


fn main() {
    input! {
        S: String,
        T: String,
    }

    // Tの方が短い
    // Tの0文字目とSのi文字目で一致度を見る
    let mut max_hit = 0;


    for i in 0..S.len() - T.len() + 1 {
        let mut cand = 0;
        for j in 0..T.len() {
            if &S[i + j..i + j + 1] == &T[j..j + 1] {
                cand += 1;
            }
        }

        max_hit = max(max_hit, cand);
    }

    let ans = T.len() - max_hit;
    println!("{}", ans);
}