Pagini recente » Cod sursa (job #2359118) | Cod sursa (job #737118) | Borderou de evaluare (job #133072) | Cod sursa (job #1613109) | Cod sursa (job #588157)
Cod sursa(job #588157)
#include<fstream.h>
#include<string.h>
#define N 2000001
char s1[N],s2[N];
long v[1001],i,t=0,k=0,m,n,j,pi[N],q=0;
int main()
{ifstream f("strmatch.in");
ofstream g("strmatch.out");
f>>s1>>s2;
m=strlen(s1);
n=strlen(s2);
pi[1]=0;
for(i=2;i<m;i++)
{while(k>0&&s1[k+1]!=s1[i])
k=pi[k];
if(s1[k+1]==s1[i])
k++;
pi[i]=k;}
for(j=1;j<n;j++)
{while(q>0&&s1[q+1]!=s2[j])
q=pi[q];
if(s1[q+1]==s2[j])
q++;
if(q==m-1&&s1[0]==s2[j-q])
{if(t<1000)
v[t]=j-m+1;
t++;}}
g<<t<<"\n";
for(i=0;i<t;i++)
g<<v[i]<<" ";
f.close();
g.close();
return 0;}