Pagini recente » Cod sursa (job #1093688) | Cod sursa (job #1200885) | Cod sursa (job #3145923) | Cod sursa (job #1851654) | Cod sursa (job #1820335)
#include <iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int urm[100],n,m,nr,apar[1001];
char *t,*p;
void urmator(char p[])
{
int m=strlen(p);
urm[0]=-1;
int k=-1;
for(int q=1;q<m;q++)
{
while(k>-1&&p[k+1]!=p[q])
k=urm[k];
if(p[k+1]==p[q])k++;
urm[q]=k;
}
}
int main()
{
FILE *f,*g;
p=new char[2000001];
t=new char[2000001];
f=fopen("strmatch.in","r");
g=fopen("strmatch.out","w");
fscanf(f,"%s%s",p,t);
int i=0;
while(p[i]>='A'&&p[i]<='Z'||p[i]>='a'&&p[i]<='z'||p[i]>='0'&&p[i]<='9')i++;
p[i]=0;
i=0;
while(t[i]>='A'&&t[i]<='Z'||t[i]>='a'&&t[i]<='z'||t[i]>='0'&&t[i]<='9')i++;
t[i]=0;
n=strlen(t);
m=strlen(p);
urmator(p);
int q=-1;
for(int i=0;i<n;i++)
{
while(q>-1&&p[q+1]!=t[i])
q=urm[q];
if(p[q+1]==t[i])
q++;
if(q==m-1)
{
if(nr<1000)
apar[nr]=i-m+1;
nr++;
q=urm[q];
}
}
fprintf(g,"%d\n",nr);
for(int i=0;i<nr;i++)
fprintf(g,"%d ",apar[i]);
delete p;
delete t;
return 0;
}