Pagini recente » Cod sursa (job #1357770) | Cod sursa (job #2303983) | Cod sursa (job #1509346) | Cod sursa (job #2587449) | Cod sursa (job #2977174)
#include <fstream>
#include <cstring>
#define DIM 2000005
#define mod 1999733
#define baza 26
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
long long n,m,h1,h2,cnt,p[DIM],sol[DIM];
char a[DIM],b[DIM];
int main() {
fin>>(a+1)>>(b+1);
n=strlen(a+1);
m=strlen(b+1);
if (n>m) {
fout<<0;
return 0;
}
p[1]=1;
for (int i=2;i<=n;i++)
p[i]=(p[i-1]*baza)%mod;
for (int i=1;i<=n;i++) {
h1=(h1+a[i]*p[n-i+1])%mod;
h2=(h2+b[i]*p[n-i+1])%mod;
}
if (h1==h2)
sol[++cnt]=0;
for (int i=n+1;i<=m;i++) {
h2=((h2-b[i-n]*p[n])%mod*baza+b[i])%mod;
if (h1==h2)
sol[++cnt]=i-n;
}
for (int i=1;i<=cnt && i<=1000;i++)
fout<<sol[i]<<" ";
return 0;
}