Pagini recente » Cod sursa (job #148168) | Cod sursa (job #2274195) | Cod sursa (job #2301501) | Cod sursa (job #2718024) | Cod sursa (job #1641432)
#include <fstream>
#include <cstring>
#define NMAX 2000003
using namespace std;
char a[NMAX], b[NMAX];
int n, m, sol[1001];
ifstream f("strmatch.in");
ofstream g("strmatch.out");
inline bool Verif(const int &i)
{ int k;
for (k=0; k<n; ++k)
if (a[k]!=b[i+k])
return 0;
return 1;
}
int main()
{ int i, k=0;
f.getline(a, NMAX);
f.get(b, NMAX);
n=strlen(a);
m=strlen(b);
long long q=50331653, h1=0, h2=0;
for (i=0; i<n; ++i)
{ h1=(h1+a[i])%q;
h2=(h2+b[i])%q;
}
for (i=0; i<=m-n; ++i)
{ if (h1==h2 && Verif(i))
{ ++k;
if (k<1000)
sol[k]=i;
}
h2=(h2-b[i]+b[i+n])%q;
}
g<<k<<'\n';
for (i=1; i<=k; ++i)
g<<sol[i]<<' ';
return 0;
}