NYOJ5 Binary String Matching ——KMP

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
char p[1000], s[1000];
int next[1000];
void getnext() {
int i = 0, j = -1, len = strlen(p);
next[0] = -1;
while (i < len - 1) {
if (j == -1 || p[j] == p[i]) {
j++; i++; next[i] = j;
}
else j = next[j];
}
}
int kmp() {
int i = -1, j = -1, lenp = strlen(p), lens = strlen(s);
getnext();
int num = 0;
while (i < lens) {
if (j == -1 || s[i] == p[j]) {++i; ++j;}
else j = next[j];
if (j == lenp) {i-=j; j = -1; num++;}
}
return num;
}
int main(void) {
int n;
while (~scanf("%d", &n))
while (n--){
scanf("%s%s", p, s);
printf("%d\n", kmp());
}

return 0;
}

#include <cstdio>
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <cstring>
using namespace std;
string s, p;
int main(void) {
int n;
while (~scanf("%d", &n)) {
while (n--) {
cin >> p >> s;
int num = 0; unsigned ans = 0;
ans = s.find(p, 0);
while (ans != string::npos) {
num++;
ans = s.find(p, ans+1);
}
printf("%d\n", num);
}
}

return 0;
}