Pagini recente » Cod sursa (job #2470129) | Istoria paginii utilizator/balan_tudor | Istoria paginii utilizator/muraru_george_cristian_323cb | Cod sursa (job #2336846) | Cod sursa (job #2495385)
#include <bits/stdc++.h>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
char a[2000005],b[2000005];
int n,n1,urm[2000005],i,k,q,poz[2000005],nr;
int main()
{
f.getline (a,2000005);
f.getline (b,2000005);
n=strlen(a);
n1=strlen(b);
urm[1]=0;
for (i=2;i<=n;i++)
{
while (k>0&&a[k]!=a[i-1])
{
k=urm[k];
}
if (a[k]==a[i-1])
{
k++;
}
urm[i]=k;
}
q=0;
for (i=0;i<n1;i++)
{
while (q>0&&a[q]!=b[i])
{
q=urm[q];
}
if (a[q]==b[i])
{
q++;
}
if (q==n)
{
poz[++nr]=i-n+1;
if (nr==1000)
{
break;
}
}
}
g<<nr<<'\n';
for (i=1;i<=nr;i++)
{
g<<poz[i]<<" ";
}
return 0;
}