#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define ull unsigned long long
const ull B = 1e8+7;
const int MAXN = 10010;
char a[MAXN],b[MAXN*100];
int ans;
int find()
{
int al=strlen(a),bl=strlen(b);
if(al>bl)return -1;
ull t=1,ah=0,bh=0;
for(int i=0;i<al;i++)
{
t*=B;
ah=ah*B+a[i];
bh=bh*B+b[i];
}
for(int i=0;i+al<=bl;i++)
{
if(ah == bh)ans++;
if(i+al < bl)bh=bh*B+b[i+al]-b[i]*t;
}
return ans;
}
int main(){
freopen("strhash.in","r",stdin);
freopen("strhash.out","w",stdout);
int i,n;
scanf("%d",&n);
getchar();
for(i=1;i<=n;i++){
ans=0;
gets(a);
gets(b);
printf("%d\n",find());
}
return 0;
}
POJ3461 字符串HASH
最新推荐文章于 2022-01-06 16:18:20 发布