Pagini recente » Cod sursa (job #348665) | Cod sursa (job #3270607) | Istoria paginii runda/eusebiuoji2004cls9/clasament | Cod sursa (job #1727915) | Cod sursa (job #2739405)
#include <bits/stdc++.h>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
string s,s1;
int poz[2000005],urm[2000005],k,val,lim,i,q;
int main()
{
f>>s;
f>>s1;
urm[0]=0;
k=0;
for (i=1;i<s.size();i++)
{
while (k>0&&s[i]!=s[k])
{
k=urm[k-1];
}
if (s[i]==s[k])
{
k++;
}
urm[i]=k;
}
val=s.size();
k=0;
for (i=0;i<s1.size();i++)
{
while (k>0&&s1[i]!=s[k])
{
k=urm[k-1];
}
if (s1[i]==s[k])
{
k++;
}
if (k==val)
{
poz[++q]=i-val+1;
}
}
g<<q<<'\n';
lim=min(q,1000);
for (i=1;i<=lim;i++)
{
g<<poz[i]<<" ";
}
return 0;
}