poj 3461(kmp，匹配成功的时候忘记跳next了，跳了到了0，贡献了几次wa)

#include <iostream>
#include <cstdio>
#include <iomanip>
#include <string>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <set>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <stack>
#include <stdlib.h>
#include <stdio.h>

#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define l(x) x<<1
#define r(x) x<<1|1
#define ms(a,b) memset(a,b,sizeof(a))
//#define ms(a,b,c,d) memset(a,b,c*sizeof(d))

using namespace std;

int len1;
int len2;
int _next[1111111];
void getNext(char *s) {
	int i = 0, k = -1;
	_next[0] = -1;
	while (i < len2) {
		if (k == -1 || s[i] == s[k])
			_next[++i] = ++k;
		else
			k = _next[k];
	}
}

int kmp(char *a, char *b) {
	int i = 0, j = 0;

	getNext(b);
	int ans = 0;
	while (i < len1) {
		//cout << i << " " << j << endl;
		if (j == -1 || a[i] == b[j]) 
			i++, j++;
		else
			j = _next[j];
		if (j == len2) {
			ans++;
			j = _next[j];
		}
	}

	return ans;
}

char p[1111111], s[1111111];

int main() {
	ios::sync_with_stdio(false);
	int t;
	cin >> t;
	while (t--) {
		cin >> p >> s;
		len1 = strlen(s);
		len2 = strlen(p);
		cout << kmp(s, p) << endl;
	}

	return 0;
}