Pagini recente » Cod sursa (job #1536745) | Monitorul de evaluare | Cod sursa (job #1894414) | Statistici Petrean Mircea (mircea_dinamo_48) | Cod sursa (job #2316129)
#include <bits/stdc++.h>
using namespace std;
ifstream in("strmatch.in");
ofstream out("strmatch.out");
string a,b;
int pi[2000002],pos[1002];
int main()
{
int i,q=0,k=0,n,m;
in>>a>>b;
n=a.size();m=b.size();
a=' '+a;
b=' '+b;
for(i=2;i<=n;i++)
{
while(q&&a[q+1]!=a[i])
q=pi[q];
if(a[q+1]==a[i])
q++;
pi[i]=q;
}q=0;
for(i=1;i<=m;i++)
{
while(q&&a[q+1]!=b[i])
q=pi[q];
if(a[q+1]==b[i])
q++;
if(q==n)
{
q=pi[n];
if(k<1000)
pos[k]=i-n;
k++;
}
}
out<<k<<"\n";k=min(k,1000);
for(i=0;i<k;i++)
out<<pos[i]<<" ";
return 0;
}