Pagini recente » Cod sursa (job #115992) | Cod sursa (job #1225197) | Cod sursa (job #1684720) | Cod sursa (job #1423176) | Cod sursa (job #1795828)
# include <fstream>
# include <cstring>
# define DIM 2000010
# define SOL 1010
#define MOD1 100007
#define MOD2 100021
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
int sol[SOL],n,m,k,i,hb1,hb2,ha1,ha2,p=73,p1,p2,r1,r2;
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\n";
return 0;
}
p1=p2=1;
for(i=1;i<=n;i++){
ha1=(p*ha1+a[i])%MOD1;
ha2=(p*ha2+a[i])%MOD2;
hb1=(p*hb1+b[i])%MOD1;
hb2=(p*hb2+b[i])%MOD2;
if(i!=1){
p1*=p;
p2*=p;
p1%=MOD1;
p2%=MOD2;
}
}
if(ha1==hb1&&ha2==hb2)
k++;
for(i=n+1;i<=m;i++){
r1=p1*b[i-n]%MOD1;
r2=p2*b[i-n]%MOD2;
hb1-=r1;
if(hb1<0)
hb1+=MOD1;
hb2-=r2;
if(hb2<0)
hb2+=MOD2;
hb1=(hb1*p+b[i])%MOD1;
hb2=(hb2*p+b[i])%MOD2;
if(ha1==hb1&&ha2==hb2){
k++;
if(k<=1000)
sol[k]=i-n;
}
}
fout<<k<<"\n";
if(k>1000)
k=1000;
for(i=1;i<=k;i++)
fout<<sol[i]<<" ";
fout<<"\n";
return 0;
}