{"problem":{"name":"Substring 2","description":{"content":"Given are strings $S$ and $T$ consisting of `0` and `1`.   We will change some of the characters in $T$ so that $T$ becomes a substring of $S$.   How many characters do we need to change at least? Wha","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":3000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc196_f"},"statements":[{"statement_type":"Markdown","content":"Given are strings $S$ and $T$ consisting of `0` and `1`.  \nWe will change some of the characters in $T$ so that $T$ becomes a substring of $S$.  \nHow many characters do we need to change at least?\nWhat is a substring? $T$ is said to be a substring of $S$ when some contiguous part of $S$ matches $T$. For example, `000` is a substring of `10001`, while `11` is not.\n\n## Constraints\n\n*   Each of $S$ and $T$ consists of `0` and `1`.\n*   $1 ≤ |T| ≤ |S| ≤ 10^6$\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":"abc196_f","tags":[],"sample_group":[["0001\n101","1\n\nChanging $T$ to `001` makes it match the $2$\\-nd through $4$\\-th characters of $S$."],["0101010\n1010101","7"],["10101000010011011110\n0010011111","1"]],"created_at":"2026-03-03 11:01:13"}}