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::{fastout, input};

#[fastout]
fn main() {
    input! {
        s: String,
        t: String,
    };
    let s_chars: Vec<char> = s.chars().collect();
    let t_chars: Vec<char> = t.chars().collect();
    let s_len = s_chars.len();
    let t_len = t_chars.len();
    // let mut dp = vec![vec![0; t_chars.len() + 1]; s_chars.len() + 1];
    let mut ans = -10000000;
    for i in 0..s_len - t_len + 1 {
        let mut temp = 0;
        for j in 0..t_len {
            if s_chars[i + j] == t_chars[j] {
                temp += 1;
            }
        }
        ans = ans.max(temp);
    }
    println!("{}", t_len as i64 - ans);

    // for i in 0..t_len {
    //     for j in i..s_len - t_len + 1 + i {
    //         dp[j + 1][i + 1] = dp[j][i] + if t_chars[i] == s_chars[j] { 1 } else { 0 };
    //     }
    // }
    // println!("{}", t_len as i64 - *dp[s_len].iter().max().unwrap());
}