Pagini recente » Cod sursa (job #3236068) | Cod sursa (job #1411467) | Cod sursa (job #501623) | Cod sursa (job #2033750) | Cod sursa (job #2288885)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
char c[2000002],x;
int n,i,k,p[2000002],nr,v[1001];
int main()
{
fin>>(c+1);
n=strlen(c+1);
for(i=2;i<=n;i++)
{
for(;k!=0&&c[k+1]!=c[i];)
k=p[k];
if(c[k+1]==c[i])
k++;
p[i]=k;
}
i=1;
k=0;
while(fin>>x)
{
i++;
for(;k!=0&&c[k+1]!=x;)
k=p[k];
if(c[k+1]==x)
k++;
if(k==n&&nr<1000)
{
nr++;
v[nr]=i;
}
}
fout<<nr<<'\n';
for(i=1;i<=nr;i++)
fout<<v[i]-n-1<<" ";
return 0;
}