Pagini recente » Cod sursa (job #3206710) | Cod sursa (job #2533884) | Cod sursa (job #2693788) | Cod sursa (job #3269127) | Cod sursa (job #3171662)
#include <bits/stdc++.h>
#define mod 1000000007
#define P 73
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
char a[2000200], b[2000200];
long long nr,nr1;
int fr, ans[2000200];
int main()
{
fin.getline(a,2000200);
fin.getline(b,2000200);
long long exp=1;
int n=strlen(a), m=strlen(b);
for(int i=0;i<n;++i)
{
nr=(nr*P+b[i])%mod;
nr1=(nr1*P+a[i])%mod;
exp=exp*P%mod;
}
exp=exp/P;
if(nr1==nr)
{
++fr;
ans[fr]=0;
}
for(int i=n;i<m;++i)
{
nr=(((nr-b[i-n]*exp)%mod+mod)*P+b[i])%mod;
if(nr1==nr)
{
++fr;
ans[fr]=i-n+1;
}
}
fout<<fr<<'\n';
for(int i=1;i<=fr;++i)
fout<<ans[i]<<" ";
return 0;
}