Pagini recente » Cod sursa (job #73219) | Cod sursa (job #1616400) | Cod sursa (job #476145) | Cod sursa (job #1109016) | Cod sursa (job #1619590)
#include <iostream>
#include <cstdio>
#include <cstring>
#define nmax 2000010
using namespace std;
char a[nmax],b[nmax];
int pref[nmax];
int nrsol,sol[1010];
inline void prefix(char *s,int *p)
{
int n=strlen(s+1);
int k=0;
p[1]=0;
for(int i=2;i<=n;i++)
{
while(k>0 && s[i]!=s[k+1])
k=p[k];
if(s[i]==s[k+1])
k++;
p[i]=k;
}
}
inline void potr(char *s,char *s1,int *p)
{
int i;
int m=strlen(s1+1);
int n=strlen(s+1);
int k=0;
p[1]=0;
for(i=1;i<=m;i++)
{
while(k>0 && s[k+1]!=s1[i])
k=p[k];
if(s[k+1]==s1[i])
k++;
if(k==n)
{
if(nrsol<1000)
{
nrsol++;
sol[nrsol]=i-n+1;
}
else nrsol++;
}
}
}
int main()
{
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);
gets(a+1);
gets(b+1);
prefix(a,pref);
potr(a,b,pref);
printf("%d\n",nrsol);
for(int i=1;i<=nrsol;i++)
{
if(i>1000) break;
printf("%d ",sol[i]-1);
}
fclose(stdin);
fclose(stdout);
return 0;
}