Pagini recente » tema | Cod sursa (job #1886088) | Cod sursa (job #2392985) | Cod sursa (job #1201270) | Cod sursa (job #2739399)
#include <bits/stdc++.h>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
string s,s1,s2;
int poz[2000005],urm[4000005],k,val,lim,i,q;
int main()
{
f>>s;
f>>s1;
s2=s+'#'+s1;
urm[0]=0;
k=0;
val=s.size();
for (i=1;i<s2.size();i++)
{
while (k>0&&s2[i]!=s2[k])
{
k=urm[k-1];
}
if (s2[i]==s2[k])
{
k++;
}
if (k==val)
{
poz[++q]=i-2*s.size();
}
urm[i]=k;
}
g<<q<<'\n';
lim=min(q,1000);
for (i=1;i<=lim;i++)
{
g<<poz[i]<<" ";
}
return 0;
}