/*较裸的kmp题,新手熟悉一下*/
#include <iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<math.h>
using namespace std;
char a[10005],s[1000005];
int next1[10005];
int alen,slen;
void pre_next()
{
int k = -1;
int i = 0;
next1[i] = k;
alen = strlen(a);
while(i < alen)
{
if(k == -1||a[i] == a[k]){
i++;
k++;
next1[i] = k;
}
else k = next1[k];
}
}
int main()
{
int t,ans = 0;
scanf("%d",&t);
while(t--)
{
ans = 0;
scanf("%s",a);
scanf("%s",s);
pre_next();
slen = strlen(s);
int i=0,j=0;
while(i<slen&&j<alen){
if(a[j] == s[i]||j == -1) {j++;i++;}
else j = next1[j];
if(j == alen){
ans++;
j = next1[j];
}
}
printf("%d\n",ans);
}
return 0;
}
POJ 3461
最新推荐文章于 2023-06-25 08:42:03 发布