Pagini recente » Cod sursa (job #3148657) | Cod sursa (job #492637) | Cod sursa (job #2581894) | Cod sursa (job #1556523) | Cod sursa (job #3286432)
#include <fstream>
#include <cstring>
#define int long long
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
int n, m, hasha, hsh[200005], ans[1005], i, base=127, p[200005], mod=1000000007, nr;
char a[200005], b[200005];
signed main()
{
fin>>a>>b;
n=strlen(a);
m=strlen(b);
p[0]=1;
for(i=1; i<=m; i++)
p[i]=p[i-1]*base%mod;
for(i=0; i<n; i++)
hasha=(hasha*base+(a[i]-'0'))%mod;
for(i=0; i<m; i++)
hsh[i]=(hsh[i-1]*base+(b[i]-'0'))%mod;
for(i=n-1; i<m; i++)
{
long long val=(hsh[i]-hsh[i-n]*p[n]%mod+mod)%mod;
if(val==hasha)
{
nr++;
if(nr<=1000)
ans[nr]=i-n+1;
}
}
fout<<nr<<'\n';
for(i=1; i<=min(1ll*1000, nr); i++)
fout<<ans[i]<<" ";
return 0;
}