Pagini recente » Cod sursa (job #647496) | Cod sursa (job #3005653) | Cod sursa (job #2766098) | Cod sursa (job #435424) | Cod sursa (job #606102)
Cod sursa(job #606102)
#include<fstream.h>
#include<string.h>
#define N 2000001
char s[N],u[N];
long v[1001],i,t,k,m,n,j,p[N],q;
int main()
{ifstream f("strmatch.in");
ofstream g("strmatch.out");
f>>s>>u;
m=strlen(s);
n=strlen(u);
p[1]=0;
for(i=2;i<m;i++)
{while(k>0&&s[k+1]!=s[i])
k=p[k];
if(s[k+1]==s[i])
k++;
p[i]=k;}
for(j=1;j<n;j++)
{while(q>0&&s[q+1]!=u[j])
q=p[q];
if(s[q+1]==u[j])
q++;
if(q==m-1&&s[0]==u[j-q])
{if(t<1000)
v[t]=j-m+1;
t++;}}
g<<t<<"\n";
if(t>1000)
t=1000;
for(i=0;i<t;i++)
g<<v[i]<<" ";
return 0;}