Pagini recente » Cod sursa (job #1635003) | Cod sursa (job #1120651) | Cod sursa (job #2438960) | Cod sursa (job #938589) | Cod sursa (job #1585213)
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
char a[2000005],b[2000005];
int pi[2000005],d[2000005],i,j,ct,k,m,n,x,y;
int main()
{a[0]=' ';
b[0]=' ';
fin.getline(a+1,2000003);
fin.getline(b+1,2000003);
pi[1]=0;
m=strlen(b)-1;
n=strlen(a)-1;
for(i=2;i<=n;i++)
{while(k>0&&a[i]!=a[k+1])k=pi[k];
if(a[i]==a[k+1])k++;
pi[i]=k;
}k=0;
if(m>1000)m=1000;
for(i=1;i<=m;i++)
{while(k>0&&b[i]!=a[k+1])k=pi[k];
if(b[i]==a[k+1])k++;
d[i]=k;
if(d[i]==n)ct++;
}
fout<<ct<<"\n";
for(i=1;i<=m;i++)
{if(d[i]==n)fout<<i-n+1<<" ";
}
}