Pagini recente » Cod sursa (job #1458063) | Cod sursa (job #157115) | Cod sursa (job #2891333) | Cod sursa (job #1775470) | Cod sursa (job #720222)
Cod sursa(job #720222)
#include<cstdio>
#include<vector>
#include<cstring>
using namespace std;
FILE *f,*g;
int k,nr,n,i,m,v[1001],d[2000001],pi[2000001];
char a[2000001],b[2000001];
void prefix()
{pi[1]=0;
for(i=2;i<=n;++i)
{while(k&&a[k+1]!=a[i])
k=pi[k];
if(a[k+1]==a[i])
++k;
pi[i]=k;
}}
void sufix()
{
for(i=1;i<=m;++i)
{while(k>0&&a[k+1]!=b[i])
k=pi[k];
if(a[k+1]==b[i])
++k;
d[i]=k;
if(d[i]==n&&nr<=1000)
{++nr;v[nr]=i-n;}
}}
int main()
{f=fopen("strmatch.in","r");
g=fopen("strmatch.out","w");
fscanf(f,"%s",&a);
fscanf(f,"%s",&b);
n=strlen(a);
m=strlen(b);
for(i=n+1;i>=1;--i)
a[i]=a[i-1];
a[0]=' ';
for(i=m+1;i>=1;--i)
b[i]=b[i-1];
b[0]=' ';
prefix();
sufix();
//vreau 100 puncte
fprintf(g,"%d\n",nr);
for(i=1;i<=nr;++i)
fprintf(g,"%d ",v[i]);
fprintf(g,"\n");
fclose(f);
fclose(g);
return 0;
}