Pagini recente » Cod sursa (job #2840805) | Cod sursa (job #1725718) | Cod sursa (job #1092590) | Cod sursa (job #297025) | Cod sursa (job #1298847)
#include<fstream>
#include<string.h>
using namespace std;
char a[2000005],b[2000005];
long n,m,p[2000005],po[1024];
int main()
{
ifstream f("strmatch.in");
ofstream g("strmatch.out");
long i,d=0;
f>>a>>b;
n=strlen(a);
m=strlen(b);
long q=1;
p[1]=0;
for(i=2;i<n;++i)
{
while(q>1&&a[q]!=a[i])
q=p[q-1];
if(a[q]==a[i])
++q;
p[i]=q;
}
q=1;
for(i=0;i<m;++i)
{
while(q>1&&a[q]!=b[i])
q=p[q-1];
if(a[q]==b[i])
++q;
if(q==n)
{
q=p[n-1];
++d;
if(d<=1000)
po[d]=i-n+1;
}
}
g<<d<<"\n";
if(d>1000)
d=1000;
for(i=1;i<=d;++i)
g<<po[i]<<" ";
f.close();
g.close();
return 0;
}