Pagini recente » Cod sursa (job #2141060) | Cod sursa (job #1911621) | Cod sursa (job #2761630) | Cod sursa (job #3191751) | Cod sursa (job #951054)
Cod sursa(job #951054)
#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=2;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&&str[i]!=p[j+1])
j=pi[j];
if(str[i]==p[j+1])
j++;
if(j==m-1)
{
k++;
if(k<=1000)
v[k]=i-m+1;
j=pi[j];
}
}
printf("%d\n", k);
for(i=1;i<=(k<=1000? k:1000);i++)
printf("%d ", v[i]);
printf("\n");
return 0;
}