Pagini recente » Cod sursa (job #2870904) | Cod sursa (job #52406) | Cod sursa (job #1388388) | Cod sursa (job #1281064) | Cod sursa (job #951049)
Cod sursa(job #951049)
#include <cstdio>
#include <cstring>
#define size 2000001
using namespace std;
char p[size], str[size];
int i, j, pi[size], m, n, v[1001], k;
int main()
{
freopen("strmatch.in", "r", stdin);
freopen("strmatch.out", "w", stdout);
scanf("%s", p); scanf("%s", str);
m=strlen(p); n=strlen(str);
j=-1;
for(i=1;i<=m-1;i++)
{
while(j>0&&p[i]!=p[j+1])
j=pi[j];
if(p[i]==p[j+1])
j++;
pi[i]=j;
}
j=-1;
for(i=0;i<=n-1;i++)
{
while(j>0&&p[j+1]!=str[i])
j=pi[j];
if(str[i]==p[j+1])
j++;
if(j==m-1)
{
v[k++]=i-m+1;
if(k>1000)
{
i=n;
break;
}
j=pi[j];
}
}
printf("%d\n", k-1);
for(i=0;i<=k-1;i++)
printf("%d ", v[i]);
printf("\n");
return 0;
}