Pagini recente » Cod sursa (job #2616818) | Cod sursa (job #2681732) | Cod sursa (job #2158264) | Cod sursa (job #1423958) | Cod sursa (job #2094843)
#include <fstream>
#include <cstring>
using namespace std;
char x[2000003],y[2000003];
int pi[2000003],s[1004];
int main()
{
int n,m,i,k=0,nr=0;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
f.getline(x+1,2000002);
f.getline(y+1,2000002);
n=strlen(x+1);
m=strlen(y+1);
for(i=2;i<=n;i++)
{
while(k>0 && x[i]!=x[k+1])
k=pi[k];
if(x[i]==x[k+1])
k++;
pi[i]=k;
}
k=0;
for(i=1;i<=m;i++)
{
while(k>0 && y[i]!=x[k+1])
k=pi[k];
if(y[i]==x[k+1])
k++;
if(k==n)
{
k=pi[k];
nr++;
if(nr<=1000)
s[nr]=i-n;
}
}
g<<nr<<"\n";
if(nr>1000)
nr=1000;
for(i=1;i<=nr;i++)
g<<s[i]<<" ";
return 0;
}