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 Kotlin (1.3.71) (judge verdict: Wrong Answer)

import kotlin.math.max

fun main() {
    fun readInt():Int{ return readLine()!!.toInt()}
    fun readLong():Long{return readLine()!!.toLong()}
    fun readString():String{return readLine()!!}
    fun readIntList():List<Int>{return readLine()!!.split(" ").map { it.toInt() }}
    fun readLongList():List<Long>{return readLine()!!.split(" ").map { it.toLong() }}
    fun readStringList():List<String>{return readLine()!!.split(" ")}
    fun readIntLists(n: Int, sorted: Boolean=false):List<List<Int>>{return if(sorted){(0 until n).map { readIntList().sorted() }}else{(0 until n).map { readIntList()}}}
    fun readLongLists(n:Int, sorted: Boolean=false):List<List<Long>>{return if(sorted){(0 until n).map { readLongList().sorted() }}else{(0 until n).map { readLongList()}}}
    fun readStringLists(n:Int):List<List<String>>{return (0 until n).map { readStringList() }}
    val a=readString()
    val b=readString()
    val n=a.length-b.length
    var ans=0
    for (i in 0 until n){
        val tmp=a.slice(i until i+b.length)
        var s=0
        for (j in 0 until b.length){
            if(tmp[j]==b[j]) {
                s++
            }
        }
        ans= max(ans, s)
    }
    println(b.length-ans)
}