Pagini recente » Cod sursa (job #1361512) | Cod sursa (job #1265391) | Cod sursa (job #947059) | Cod sursa (job #352537) | Cod sursa (job #1643045)
#include <fstream>
#include <cstring>
#include <ctime>
#include <cstdlib>
#define NMAX 2000003
using namespace std;
char a[NMAX], b[NMAX];
int n, m, sol[NMAX], k, mod1, mod2;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
inline bool Verific(const int &k)
{ int i;
for (i=0; i<m; ++i)
if (b[i]!=a[i+k])
return 0;
return 1;
}
int main()
{ srand(time(0));
rand();
mod1=rand();
mod2=rand();
f.getline(b, NMAX);
f.get(a, NMAX);
n=strlen(a);
m=strlen(b);
long long h1=0, h2=0, H1=0, H2=0;
int i;
for (i=0; i<m; ++i)
{ h1=(h1+a[i])%mod1;
h2=(h2+b[i])%mod1;
H1=(H1+a[i])%mod2;
H2=(H2+b[i])%mod2;
}
for (i=0; i<=n-m; ++i)
{ if (h1==h2 && Verific(i))
{ ++k;
if (k<=1000)
sol[k]=i;
}
h1=(h1-a[i]+a[i+m])%mod1;
H1=(H1-a[i]+a[i+m])%mod2;
}
g<<k<<'\n';
for (i=1; i<=min(k, 1000); ++i)
g<<sol[i]<<' ';
return 0;
}