Pagini recente » Cod sursa (job #1508847) | Cod sursa (job #2689323) | Cod sursa (job #1893299) | Cod sursa (job #23609) | Cod sursa (job #1183644)
#include <fstream>
#include <string.h>
using namespace std;
const int q=101, d=256;
int n, m, i, j, p, t, h=1;
char a[2000003], b[2000003];
int poz[2000003], k;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
int main()
{
f.getline(b, 2000003);
f.get(a, 2000003);
n=strlen(a);
m=strlen(b);
if (m>n)
g<<0;
else {
for (i=1; i<m; ++i)
h=(h*d)%q;
for (i=0; i<m; ++i) {
p=(p*d+b[i])%q;
t=(t*d+a[i])%q;
}
for (i=0; i<=n-m; ++i) {
if (p==t) {
for (j=0; j<m; ++j)
if (a[i+j]!=b[j])
j=m+1;
if (j==m)
poz[++k]=i;
}
t=(d*(t-h*a[i])+a[i+m])%q;
if (t<0)
t+=q;
}
g<<k<<'\n';
for (i=1; i<=k; ++i)
g<<poz[i]<<' ';
}
return 0;
}