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