Pagini recente » Cod sursa (job #43648) | Cod sursa (job #1476572) | Cod sursa (job #1733861) | Cod sursa (job #2450858) | Cod sursa (job #1550148)
#include <fstream>
#include <cstring>
#define p 73
#define m1 100007
#define m2 100021
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
char A[2000001],B[2000001],C[2000001];
int n,p1=1,p2=1,a1,b1,a2,b2,nr,na,nb,i;
int main()
{
fin.getline(A,2000001);
fin.getline(B,2000001);
na=strlen(A);
nb=strlen(B);
if(na>nb)
{
fout<<0;
return 0;
}
for(i=0; i<na; i++)
{
a1=(a1*p+A[i])%m1;
a2=(a2*p+A[i])%m2;
b1=(b1*p+B[i])%m1;
b2=(b2*p+B[i])%m2;
if(i!=0)
{
p1=(p1*p)%m1;
p2=(p2*p)%m2;
}
}
if(a1==b1 && a2==b2)
{
C[0]=1;
nr++;
}
for(i=na; i<nb; i++)
{
b1=((b1-(B[i-na]*p1)%m1+m1)*p+B[i])%m1;
b2=((b2-(B[i-na]*p2)%m2+m2)*p+B[i])%m2;
if(a1==b1 && a2==b2)
{
C[i-na+1]=1;
nr++;
}
}
fout<<nr<<'\n';
for(i=0; i<=nb && i<=1000; i++)
if(C[i]==1)
fout<<i<<" ";
return 0;
}