Pagini recente » Cod sursa (job #2381795) | Cod sursa (job #3005078) | Cod sursa (job #2958610) | Cod sursa (job #81515) | Cod sursa (job #629553)
Cod sursa(job #629553)
#include <cstdio>
#include <cstring>
#define p 666013
#define baza 54
#define lmax 2000005
using namespace std;
long nra, nrb, k, i, la, lb, rez, blan, x, vrez[1005];
bool ok;
char a[lmax], b[lmax];
void verificare()
{
ok=1;
for (k=0;(k<lb&&ok);k++)
ok=(b[k]==a[i+k]);
rez+=ok;
if ((rez<=1000) &&(ok))
vrez[rez]=i;
}
long num(char q)
{
if ((q>='a')&&(q<='z'))
return q-'a';
if ((q>='A')&&(q<='Z'))
return q-'A'+27;
return q-'0'+54;
}
int main()
{
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);
gets(b); gets(a);
la=strlen(a); lb=strlen(b);
blan=1;
for (i=1;i<=lb-1;i++)
blan=(blan*baza)%p;
for (i=0;i<lb;i++)
{
nra=(nra*baza+num(a[i]))%p;
nrb=(nrb*baza+num(b[i]))%p;
}
i=0;
if (nra==nrb)
verificare();
for (i=1;i<=la-lb;i++)
{
nra=(nra-blan*num(a[i-1]))%p;
nra=(nra*baza)%p;
nra+=num(a[i+lb-1]);
nra=(nra+p)%p;
if (nra==nrb)
verificare();
}
printf("%ld\n",rez);
if (rez>1000)
rez=1000;
for (i=1;i<=rez;i++)
printf("%ld ",vrez[i]);
return 0;
}