KMP算法

#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1e6 + 10;
const int INF = 0x3f3f3f3f;
int Next[N];
char a[N];
char b[N];
int n,ans;
void get_next() {
    int i = 0;
    int j = -1;
    Next[0] = -1;
    while(b[i] != '\0') {
        if(j == -1 || b[i] == b[j]) {
            i++;
            j++;
            Next[i] = j;
        }
        else {
            j = Next[j];
        }
    }
}
void KMP() {
    int i = 0;
    int j = 0;
    ans = 0;
    int len1 = strlen(a);
    int len2 = strlen(b);
    while(i < len1) {
        if(j == -1 || a[i] == b[j]) {
            i++;
            j++;
            if(j == len2) {
                ans++;
            } 
        }
        else {
            j = Next[j];
        }
    }
    cout << ans << endl;
}
int main() {
    ios::sync_with_stdio(false);
    cin >> n;
    while(n--) {
        cin >> b;
        cin >> a;
        get_next();
        KMP();
    }
}