Pagini recente » Cod sursa (job #2975083) | Cod sursa (job #2211305) | Cod sursa (job #44674) | Cod sursa (job #1111365) | Cod sursa (job #1655647)
#include <cstdio>
#include<cstring>
#define MAX 2003
using namespace std;
char a[MAX],b[MAX];
int pi[MAX],rez[MAX];
void makepi(int n)
{
int k=0;
pi[1]=0;
for(int i=2; i<=n; i++)
{
while(k>0 && a[k+1]!=a[i])
k=pi[k];
if(a[k+1]==a[i])
k++;
pi[i]=k;
}
}
int main()
{
FILE *fin,*fout;
fin=fopen("strmatch.in","r");
fout=fopen("strmatch.out","w");
int la,lb;
fgets(1+a,sizeof(a),fin);
fgets(1+b,sizeof(b),fin);
la=strlen(1+a) - 1;
lb=strlen(1+b) - 1;
makepi(la);
int q=0,cnt=0,cnt2=0;
for(int i=1; i<=lb; i++)
{
while(q>0 && a[q+1]!=b[i])
q=pi[q];
if (a[q+1]==b[i])
q++;
if(q==la)
{
cnt++;
if(cnt2<1000)
rez[++cnt2]=i-la;
}
}
fprintf(fout,"%d\n",cnt);
for(int i=1; i<=cnt2; i++)
fprintf(fout,"%d ",rez[i]);
return 0;
}