摘要： http://acm.nyist.net/JudgeOnline/problem.php?pid=5Binary String Matching时间限制：3000 ms | 内存限制：65535 KB难度：3描述Given two strings A and B, whose alphabet consist only ‘0’ and ‘1’. Your task is only to tell how many times does A appear as a substring of B? For example, the text string B is ‘1001110110’ whi 阅读全文