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)

use std::*;

fn main() {
    let _s = read::<String>();
    let _t = read::<String>();
    let s = _s.as_bytes();
    let t = _t.as_bytes();
    let l = t.len();
    let mut ans = i32::MAX;
    for i in 0..(s.len() - l + 1) {
        let mut c = 0;
        for j in 0..l {
            if s[i + j] != t[j] {
                c += 1;
            }
        }
        ans = cmp::min(c, ans);
    }
    println!("{}", ans);
}

#[allow(dead_code)]
fn read<T: str::FromStr>() -> T {
    let mut _in = String::new();
    io::stdin().read_line(&mut _in).ok();
    _in.trim().parse().ok().unwrap()
}

#[allow(dead_code)]
fn read_vec<T: str::FromStr>() -> Vec<T> {
    read::<String>().split(' ').map(|w| w.parse().ok().unwrap()).collect()
}