Pagini recente » Cod sursa (job #976313) | Cod sursa (job #666247) | Cod sursa (job #594222) | Cod sursa (job #98382) | Cod sursa (job #1052096)
//nu ii frumos sa te uiti pe sursele altora:))...hotule....nu o sti face singur?:))
#include <iostream>
#include <stdio.h>
#include <cstring>
using namespace std;
FILE *fin=fopen("strmatch.in", "r");
FILE *fout=fopen("strmatch.out", "w");
#define MAX 2000010
#define sigma 128
#define A 100007
#define B 100021
char a[MAX], b[MAX];
int rez[MAX];
int main()
{
fscanf(fin, "%s %s", a, b);
int n=strlen(a);
int m=strlen(b);
long long numar1=0, numar2=0;
int i;
for(i=0;i<n;i++)
{
numar1=(numar1*sigma+a[i])%A;
numar2=(numar2*sigma+a[i])%B;
}
long long nr1=0, nr2=0;
if(n>m)
{
fprintf(fout, "0\n");
return 0;
}
long long A1=1,B1=1;
for(i=0;i<n;i++)
{
nr1=(nr1*sigma+b[i])%A;
nr2=(nr2*sigma+b[i])%B;
if(i)
{
A1=(A1*sigma)%A;
B1=(B1*sigma)%B;
}
}
int count=0;
if(numar1==nr1 && numar2==nr2)
{
rez[++count]=0;
}
for(i=n;i<m;i++)
{
nr1=((nr1-(b[i-n]*A1)%A+A)*sigma+b[i])%A;
nr2=((nr2-(b[i-n]*B1)%B+B)*sigma+b[i])%B;
if(nr1==numar1 && nr2==numar2)
{
rez[++count]=i-n+1;
}
}
fprintf(fout, "%d\n", count);
for(i=1;i<=count;i++)
{
fprintf(fout, "%d ", rez[i]);
}
}