Pagini recente » Cod sursa (job #3147664) | Cod sursa (job #2520303) | Cod sursa (job #2779024) | Cod sursa (job #27801) | Cod sursa (job #1225655)
#include<cstdio>
#include<vector>
using namespace std;
char A[2000001],B[2000001];
int i,pre,k[2000001],p,cnt;
vector <int> v;
int main()
{
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);
gets(A);
gets(B);
int n=1;
for(i=1;A[i]!=0;i++)
{
n++;
pre=k[i-1];
while(A[pre]!=A[i]&&pre>0)
{
pre=k[pre-1];
}
if(A[i]!=A[pre])
k[i]=0;
else
k[i]=pre+1;
//printf("%d->%d\n",i,k[i]);
}
p=0;
for(i=0;B[i]!=0;i++)
{
while(A[p]!=B[i]&&p>0)
{
p=k[p-1];
}
if(A[p]==B[i])
{
p++;
if(p==n)
{
cnt++;
if(v.size()<1000)
v.push_back(i-n+1);
p=k[p-1];
}
}
}
printf("%d\n",cnt);
for(i=0;i<v.size();i++)
printf("%d ",v[i]);
return 0;
}