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)

use std::cmp::{min, max};
use std::io::*;
use std::str::FromStr;

fn read<T: FromStr>() -> T {
    let stdin = stdin();
    let stdin = stdin.lock();
    let token: String = stdin
        .bytes()
        .map(|c| c.expect("Failed to read bytes") as char)
        .skip_while(|c| c.is_whitespace())
        .take_while(|c| !c.is_whitespace())
        .collect();
    token.parse().ok().expect("failed to parse token")
}

fn main() {
    let s:String = read();
    let t:String = read();
    let t_vec:Vec<char> = t.chars().collect();
    let s_vec:Vec<char> = s.chars().collect();
    let mut v = vec![Vec::new(); t.len()];
    for i in 0..t.len()-1 {
        for j in 0..s.len()-1 {
            if s_vec[j] == t_vec[i] {
                v[i].push(j);
                break;
            }
        }
    }
    let mut m = 0;
    for i in v {
        let mut s = i.clone();
        s.sort();
        if s == i {
            m = max(m, *s.last().unwrap_or(&0) as i64 - *s.first().unwrap_or(&0) as i64 - s.len() as i64 + 1);
        }
    }
    println!("{}", t.len()-m as usize);
}