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

fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
.split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}

fn main() {
    // solver code...
    let s_tmp = read::<String>();
    let t_tmp = read::<String>();

    let s: Vec<char> = s_tmp.chars().collect();
    let t: Vec<char> = t_tmp.chars().collect();
    let mut max_count = 0;
    let range: usize = s.len() - t.len();
    for i in 0..range {
        let mut tmp_count = 0;
        for j in 0..t.len() {
            if s[i+j] == t[j] {
                tmp_count += 1;
            }
        }
        max_count = std::cmp::max(max_count, tmp_count);
    }
    println!("{}", t.len() - max_count)
}