Pagini recente » Cod sursa (job #2253353) | Cod sursa (job #386045) | Cod sursa (job #1255809) | Cod sursa (job #537738) | Cod sursa (job #2215786)
#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);
while(in>>x)
b[k++]=x;
j=0;
i=1;
while(i<n)
{
if(a[i]==a[j])
{
p[i]=j+1;
i++;
j++;
}
else {
while(a[j]!=a[i]&&j>0)
j=p[j-1];
if(a[j]==a[i]) p[i]=j+1;
else p[i]=0;
i++;
}
}
j=0;
for(i=0;i<k;i++)
{
while(a[j]!=b[i]&&j>0) j=p[j-1];
if(j==n-1)
{
v[++q]=i-n+1;
j=p[j-1];
}
if(a[j]==b[i]) j++;
}
out<<q<<'\n';
for(i=1;i<=min(q,1000);i++) out<<v[i]<<" ";
return 0;
}