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 proconio::*;

fn diff(t: &str, s: &str) -> usize {
    let mut ret = 0;
    let m = t.len();
    let mut t = t.char_indices();
    let mut s = s.char_indices();
    for i in 0..m {
        let tt = t.next().unwrap().1;
        let ss = s.next().unwrap().1;
        if tt != ss {
            ret += 1;
        }
    }

    ret
}

fn main() {
    input!{
        s: String,
        t: String,
    }

    let mut ans = 100000;
    for i in 0..(s.len() - t.len() + 1) {
        ans = ans.min(diff(&t[0..t.len()], &s[i..i+t.len()]));
    }

    println!("{}", ans);
}