Pagini recente » Profil MiuCatalin | Monitorul de evaluare | Cod sursa (job #1138141) | Cod sursa (job #2271109) | Cod sursa (job #2495348)
#include <bits/stdc++.h>
#define MOD 1000000001
#define baza 73
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
char a[2000005],b[2000005];
int n,n1,i,sum,sum1,nr,v[2000005];
int val (char x)
{
return int(x)-65;
}
int ridput (int a,int b,int mod)
{
if (b==0)
{
return 1;
}
int rez=ridput(a,b/2,mod);
if (b%2==0)
{
return (rez*rez)%mod;
}
return ((rez*rez)%mod*a)%mod;
}
int main()
{
f.getline (a,2000005);
f.getline (b,2000005);
n=strlen(a);
n1=strlen(b);
for (i=0;i<n;i++)
{
sum=(sum+(1LL*ridput(baza,i,MOD)*val(a[i]))%MOD)%MOD;
}
for (i=0;i<n&&i<n1;i++)
{
sum1=(sum1+(1LL*ridput(baza,i,MOD)*val(b[i]))%MOD)%MOD;
}
if (sum1==sum)
{
nr++;
v[nr]=0;
}
for (i=n;i<n1;i++)
{
sum1=sum1/baza;
sum1=(sum1+(1LL*ridput(baza,n-1,MOD)*val(b[i]))%MOD)%MOD;
if (sum1==sum)
{
nr++;
v[nr]=i-n+1;
}
if (nr==1000)break;
}
g<<nr<<'\n';
for (i=1;i<=nr;i++)
{
g<<v[i]<<" ";
}
return 0;
}