HDU5918 Sequence I(kmp，间隔匹配)Problem DescriptionInputOutputSample InputSample Output思路代码
Problem Description Mr. Frog has two sequences a1,a2,⋯,an and b1,b2,⋯,bm and a number p. He wants to know the number of positions q such that sequence b1,b2,⋯,bm is exactly the sequence aq,aq+p
