万分感谢@ice1000，%%%

Algorithms/String/KMP.cpp

@@ -1,91 +1,31 @@
-/*#include <cstdio>
+#include <cstdio>
 #include <cstring>
-char s[100000], p[100000];
+char a[1 << 20 | 1], b[1 << 14 | 1];
-int next[100000];
+int la, lb;
-void getNext(char* P)
+int next[1 << 14 | 1];
-{
-    int lenP = strlen(P);
-    next[0] = -1;
-    int k = -1, i = 0;
-    while (i < lenP - 1)
-        if (k == -1 || P[k] == P[i])
-            i++, k++, next[i] = (p[i] == p[k]) ? next[k] : k;
-        else k = next[k];
-}
-int match(char* S, char* P)
-{
-    int lenS = strlen(S), lenP = strlen(P), i = 0, j = 0;
-    while (i < lenS && j < lenP)
-        if (j == -1 || S[i] == P[j])
-            i++, j++;
-        else
-            j = next[j];
-    return j == lenP ? i - j : -1;
-}
 int main()
 {
+    next[0] = -1;
     int n;
     scanf("%d", &n);
-    for (int i = 0; i < n; i++)
+    while (n--)
     {
-        scanf("%s%s", p, s);
+        scanf("%s%s", b, a);
-        getNext(p);
+        la = strlen(a), lb = strlen(b);
-        char* str = s;
+        for (int i = 1, j = -1; i < lb; i++)
-        int pos = match(str, p), ans = 0;
+        {
-        while (pos != -1)
+            while (~j && b[j + 1] != b[i]) j = next[j];
+            if (b[j + 1] == b[i]) j++;
+            next[i] = j;
+        }
+        int ans = 0;
+        for (int i = 0, j = -1; i < la; i++)
         {
-            ans++;
+            while (~j && b[j + 1] != a[i]) j = next[j];
-            str += pos + 1;
+            if (b[j + 1] == a[i]) j++;
-            pos = match(str, p);
+            if (j == lb - 1) ans++, j = next[j];
         }
         printf("%d\n", ans);
     }
     return 0;
-}*/
-#include <cstdio>
-#include <cstring>
-using namespace std;
-const int mt = 1e6 + 5;
-char x[mt], y[mt], next[mt];
-int m, n;
-void pre()
-{
-    int i = 0, j = next[0] = -1;
-    while (i != m)
-    {
-        if (-1 == j || y[i] == y[j])
-            next[++i] = ++j;
-        else
-            j = next[j];
-    }
-}
-int cnt()
-{
-    pre();
-    int i = 0, j = 0, ans = 0;
-    while (i != n && j != m)
-    {
-        if (-1 == j || y[i] == x[j])
-            i++, j++;
-        else
-            j = next[j];
-        if (j == m)
-            ans++, i -= j - 1, j = -1;
-    }
-    return ans;
-}
-int main()
-{
-    int t;
-    scanf("%d", &t);
-    while (t--)
-    {
-        scanf("%s", x);
-        scanf("%s", y);
-        m = strlen(x), n = strlen(y);
-        //cout<<m<<endl<<n<<endl;
-        //cout<<x<<endl<<y<<endl;
-        printf("%d\n", cnt());
-    }
-    return 0;
 }