Pagini recente » Cod sursa (job #1959241) | Cod sursa (job #1766293) | Cod sursa (job #1904371) | Cod sursa (job #2438347) | Cod sursa (job #2122901)
#include <fstream>
#include <cstring>
using namespace std;
char a[2000002],b[2000002];
int pi[2000002],d[2000002];
int main()
{
int n,m,i,j,nr,k;
ifstream in("strmatch.in");
ofstream out("strmatch.out");
in>>a+1>>b+1;
n=strlen(a+1);
m=strlen(b+1);
nr=0;
k=0;
pi[1]=0;
for(i=2;i<=n;i++)
{
while(k>0&&a[i]!=a[k+1])
{
k=pi[k];
}
if(a[k+1]==a[i])
{
k++;
}
pi[i]=k;
}
k=0;
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(k==n)
nr++;
}
out<<nr<<"\n";
nr=min(nr,1000);
for(i=1;i<=m;i++)
{
if(d[i]==n)
{
out<<i-n<<" ";
nr--;
}
if(nr==0)
break;
}
return 0;
}