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::input;

fn main() {
    input! {
        string: String,
        model: String
    }

    let string_len = string.chars().count();
    let model_len = model.chars().count();

    let mut result = model_len;

    let limit = string_len - model_len;
    let mut current_index = 0;

    loop {
        let current = match string.get(current_index..current_index + model_len) {
            Some(c) => c,
            None => break
        };

        // println!("{}", current);

        let diff = model
            .chars()
            .zip(current.chars())
            .filter(|(a, b)| a != b)
            .count();

        // println!("current: {}, diff: {}, re: {} ", current, diff, result);

        result = result.min(diff);
        if result == 0 {
            break;
        }

        current_index += 1;
        if current_index == limit {
            break;
        }
    }

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