Pagini recente » Cod sursa (job #3336081) | Monitorul de evaluare | Cod sursa (job #505698) | Cod sursa (job #1340959) | Cod sursa (job #505693)
Cod sursa(job #505693)
#include <stdio.h>
#include <string.h>
using namespace std;
char t[20000],p[20000];
int lT,lP,l[100],time=0,times[10000];
void createL()
{
int k;
l[1]=0;
for(int i=2;i<=strlen(p+1)-1;i++)
{
k=l[i-1];
while(k>0&&p[k+1]!=p[i]) k=l[k];
if(p[k+1]==p[i]) k++;
l[i]=k;
}
}
void KMP()
{
int k=0;
for(int i=1;i<=strlen(t+1)-1;i++)
{
while(k>0&&p[k+1]!=t[i]) k=l[k];
if(p[k+1]==t[i])k++;
if(k==strlen(p+1)-1)
{
times[time]=i-strlen(p+1)+1;
time++;
k=l[k];
}
}
}
int main()
{
freopen("KMP.in","r",stdin);
freopen("KMP.out","w",stdout);
/*gets(p2);
gets(t2);
strcat(t,t2);
strcat(p,p2);*/
fgets(p+1,2000000,stdin);
fgets(t+1,2000000,stdin);
createL();
KMP();
printf("%d",time);
printf("\n");
for(int i=0;i<time-1;i++) printf("%d ",times[i]);
printf("%d\n",times[time-1]);
//printf("\n");
return 0;
}