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)

fn main() {
    let s = {
        let mut s = String::new();
        std::io::stdin().read_line(&mut s).unwrap();
        s.trim_end().to_owned()
    };
    let t = {
        let mut s = String::new();
        std::io::stdin().read_line(&mut s).unwrap();
        s.trim_end().to_owned()
    };

    let all:Vec<char>=s.chars().collect();
    let partial:Vec<char>=t.chars().collect();
    let mut check:Vec<u32>=Vec::new();

    for i in 0..(all.len()-partial.len()+1)
    {
        let mut count:u32=partial.len() as u32;
        for j in 0..partial.len()
        {
            if all[i+j as usize]==partial[j as usize]{
                count-=1;
            }
        }
        check.push(count);
    }

    let  ans:&u32=check.iter().min().unwrap();

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