Pagini recente » Cod sursa (job #1772206) | Cod sursa (job #2453364) | Cod sursa (job #3126114) | Cod sursa (job #2005499) | Cod sursa (job #2495379)
#include <bits/stdc++.h>
#define MOD 1000000007
#define baza 128
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
char a[2000005],b[2000005];
long long n,n1,i,sum,sum1,nr,v[2000005];
long long val (char x)
{
return int(x);
}
long long ridput (long long a,long long b)
{
if (b==0)
{
return 1LL;
}
long long rez=ridput(a,b/2);
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)*val(a[i]))%MOD)%MOD;
}
for (i=0;i<n&&i<n1;i++)
{
sum1=(sum1+(1LL*ridput(baza,i)*val(b[i]))%MOD)%MOD;
}
if (sum1==sum)
{
nr++;
v[nr]=0;
}
for (i=n;i<n1;i++)
{
sum1=(((sum1-val(b[i-n])+MOD))%MOD*ridput(baza,MOD-2))%MOD;
sum1=(sum1+(1LL*ridput(baza,n-1)*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;
}