{"problem":{"name":"Substring","description":{"content":"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 consecu","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc177_b"},"statements":[{"statement_type":"Markdown","content":"Given are two strings $S$ and $T$.\nLet us change some of the characters in $S$ so that $T$ will be a substring of $S$.\nAt least how many characters do we need to change?\nHere, a substring is a consecutive subsequence. For example, `xxx` is a substring of `yxxxy`, but not a substring of `xxyxx`.\n\n## Constraints\n\n*   The lengths of $S$ and $T$ are each at least $1$ and at most $1000$.\n*   The length of $T$ is at most that of $S$.\n*   $S$ and $T$ consist of lowercase English letters.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$S$\n$T$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc177_b","tags":[],"sample_group":[["cabacc\nabc","1\n\nFor example, changing the fourth character `a` in $S$ to `c` will match the second through fourth characters in $S$ to $T$.\nSince $S$ itself does not have $T$ as its substring, this number of changes - one - is the minimum needed."],["codeforces\natcoder","6"]],"created_at":"2026-03-03 11:01:14"}}