nyoj5 字符串匹配

  Binary String Matching 時間限制： 3000 ms  |  內存限制： 65535 KB     描述 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 substri

>>阅读原文<<