{"raw_statement":[{"iden":"problem statement","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."},{"iden":"constraints","content":"*   Each of $S$ and $T$ consists of `0` and `1`.\n*   $1 ≤ |T| ≤ |S| ≤ 10^6$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$S$\n$T$"},{"iden":"sample input 1","content":"0001\n101"},{"iden":"sample output 1","content":"1\n\nChanging $T$ to `001` makes it match the $2$\\-nd through $4$\\-th characters of $S$."},{"iden":"sample input 2","content":"0101010\n1010101"},{"iden":"sample output 2","content":"7"},{"iden":"sample input 3","content":"10101000010011011110\n0010011111"},{"iden":"sample output 3","content":"1"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}