Pagini recente » Cod sursa (job #1430777) | Cod sursa (job #913728) | Cod sursa (job #1484781) | Cod sursa (job #2660906) | Cod sursa (job #2216066)
#include <fstream>
#include <cstring>
using namespace std;
ifstream in("strmatch.in");
ofstream out("strmatch.out");
char a[2000100],b[2000100],x;
int i,n,m,k,j,nr,v[2000100],q;
int p[2000100];
int main()
{
in.get(a,2000100);
n=strlen(a);
for(i=n;i>0;i--)
a[i]=a[i-1];
while(in>>x)
b[++k]=x;
j=0;
i=2;
p[1]=0;
while(i<=n)
{
while(a[i]!=a[j+1]&&j>0) j=p[j];
if(a[i]==a[j+1])
j++;
p[i]=j;
i++;
}
j=0;
i=1;
while(i<=k)
{
while(b[i]!=a[j+1]&&j>0) j=p[j];
if(b[i]==a[j+1])
j++;
if(j==n)
{
j=p[n];
v[++q]=i-n;
}
i++;
}
out<<q<<'\n';
for(i=1;i<=min(q,1000);i++) out<<v[i]<<" ";
return 0;
}