Pagini recente » Cod sursa (job #3128191) | Cod sursa (job #993495) | Cod sursa (job #1797200) | Cod sursa (job #2639004) | Cod sursa (job #2790523)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
int n,m,v1,v2,k1=1,k2=1,x1,x2,i,m1=100007,m2=100021;
char a[2000005],b[2000005];
int r[1005],nr;
int main()
{
fin>>a>>b;
for(i=0;a[i];i++)
{
x1=((x1*76)%m1+a[i]-47)%m1;
x2=((x2*76)%m2+a[i]-47)%m2;
if(i>0)
{
k1=(k1*76)%m1;
k2=(k2*76)%m2;
}
}
n=i;
for(i=0;b[i];i++)
{
if(i<n)
{
v1=((v1*76)%m1+b[i]-47)%m1;
v2=((v2*76)%m2+b[i]-47)%m2;
if(i==n-1&&x1==v1&&x2==v2)nr++;
}
else {
v1=(v1-((b[i-n]-47)*k1)%m1)%m1;
if(v1<0)v1+=m1;
v1=((v1*76)%m1+(b[i]-47))%m1;
v2=(v2-((b[i-n]-47)*k2)%m2)%m2;
if(v2<0)v2+=m2;
v2=((v2*76)%m2+(b[i]-47))%m2;
if(x1==v1&&x2==v2)
{
if(nr<1000)
r[++nr]=i-n+1;
else nr++;
}
}
}
fout<<nr<<'\n';
if(nr>1000)nr=1000;
for(i=1;i<=nr;i++)fout<<r[i]<<' ';
return 0;
}