Pagini recente » Cod sursa (job #119368) | Cod sursa (job #190351) | Cod sursa (job #2372396) | Cod sursa (job #2457877) | Cod sursa (job #951055)
Cod sursa(job #951055)
#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);
gets(p+1); gets(str+1);
m=strlen(p+1); n=strlen(str+1);
p[0]=str[0]=' ';
j=0;
for(i=2;i<=m;i++)
{
while(j>0&&p[i]!=p[j+1])
j=pi[j];
if(p[i]==p[j+1])
j++;
pi[i]=j;
}
j=0;
for(i=1;i<=n;i++)
{
while(j>0&&str[i]!=p[j+1])
j=pi[j];
if(str[i]==p[j+1])
j++;
if(j==m)
{
k++;
if(k<=1000)
v[k]=i-m;
j=pi[j];
}
}
printf("%d\n", k);
if(k>1000)
k=1000;
for(i=1;i<=k;i++)
printf("%d ", v[i]);
printf("\n");
return 0;
}