Pagini recente » Cod sursa (job #2196820) | Cod sursa (job #2843018) | Cod sursa (job #531193)
Cod sursa(job #531193)
// infoarena: problema/strmatch //
#include <fstream>
#include <cstring>
#include <vector>
using namespace std;
ifstream in("strmatch.in");
ofstream out("strmatch.out");
const int MOD = 666013;
const int MAXN = 3000010;
const int B = 257;
char c,a[MAXN],b[MAXN];
int n,m,hb,h,i,x;
int sol[MAXN];
int verifica(int i)
{
int k;
for(k=0; k<m; k++)
if(a[k+i] != b[k])
return 0;
return sol[++sol[0]] = i;
}
int main()
{
in>>b;
m = strlen(b);
in>>a;
n = strlen(a);
h = hb = 0;
x=1;
for(i=1; i<m; i++)
x = (x*B)%MOD;
for(i=0; i<m; i++)
{
hb = (B*hb + b[i])%MOD;
h = (B*h + a[i])%MOD;
}
if(hb == h)
verifica(0);
for(i=1; i<=n-m+1; i++)
{
h = (((h - (x*a[i-1])%MOD + MOD)*B) + a[i+m-1])%MOD;
h == hb && verifica(i);
}
out<<sol[0]<<'\n';
for(i=1, x=min(sol[0], 1000); i<=x; i++)
out<<sol[i]<<' ';
return 0;
}