Pagini recente » Cod sursa (job #748165) | Cod sursa (job #1263423) | Cod sursa (job #2441222) | Cod sursa (job #2690536) | Cod sursa (job #236682)
Cod sursa(job #236682)
#include<stdio.h>
#include<string.h>
#define NMAX 2000001
char a[NMAX],b[NMAX];
int n,m,lung=0;
int sol[10001];
int baza,hasha=0,hashb=0,hashc=0,hashd=0,baza2;
void RK()
{
int i;
baza=1;
baza2=1;
hasha=hashb=0;
for(i=m-1;i>=0;i--)
{
hasha=(hasha+a[i]*baza)%100007;
hashb=(hashb+b[i]*baza)%100007;
hashc=(hashc+a[i]*baza2)%100021;
hashd=(hashd+b[i]*baza2)%100021;
if(i>0)
{
baza=(baza*32)%100007;
baza2=(baza2*73)%100021;
}
}
if(hasha==hashb&&hashc==hashd)sol[++lung]=0;
for(i=1;i<n-m+1;i++)
{
hashb=(hashb-(b[i-1]*baza)%100007+100007)%100007;
hashb=(hashb*32+b[i+m-1])%100007;
hashd=(hashd-(b[i-1]*baza2)%100021+100021)%100021;
hashd=(hashd*73+b[i+m-1])%100021;
if((hasha==hashb)&&hashc==hashd)
if(n>1000&&lung>1000)
lung++;
else
sol[++lung]=i;
}
printf("%d\n",lung);
for(i=1;i<=lung&&i<=1000;i++)
printf("%d ", sol[i]);
}
int main()
{
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);
scanf("%s\n",a);
scanf("%s",b);
m=strlen(a);
n=strlen(b);
RK();
return 0;
}