Pagini recente » Cod sursa (job #754629) | Cod sursa (job #1583302) | Cod sursa (job #123484) | Cod sursa (job #172981) | Cod sursa (job #2316128)
#include <bits/stdc++.h>
using namespace std;
ifstream in("strmatch.in");
ofstream out("strmatch.out");
string a,b;
int pi[2000002],pos[1005];
int main()
{
int i,q=0,k=0,n,m;
in>>a>>b;
n=a.size();m=b.size();
for(i=1;i<n;i++)
{
while(q&&a[q]!=a[i])
q=pi[q];
if(a[q]==a[i])
q++;
pi[i]=q;
}q=0;
for(i=0;i<m;i++)
{
while(q&&a[q]!=b[i])
q=pi[q];
if(a[q]==b[i])
q++;
if(q==n)
{
q=pi[n-1];
if(k<1000)
pos[k]=i-n+1;
k++;
}
}
out<<k<<"\n";k=min(k,1000);
for(i=0;i<k;i++)
out<<pos[i]<<" ";
return 0;
}