Pagini recente » Cod sursa (job #2670804) | Cod sursa (job #2228303) | Cod sursa (job #1622762) | Cod sursa (job #2254669) | Cod sursa (job #2128879)
#include <fstream>
#include <cstring>
#define LMAX 2000002
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
char a[LMAX],b[LMAX];
int pi[LMAX],d[LMAX];
int main()
{
int n,m,sol=0,k;
f>>a+1;
f>>b+1;
n=strlen(a+1);
m=strlen(b+1);
k=0;
for(int 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;
for(int 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)
sol++;
}
g<<sol<<endl;
sol=min(sol,1000);
for(int i=1;i<=m;i++)
{
if(d[i]==n && sol>0)
{
g<<i-n<<" ";
sol--;
}
if(sol==0)
break;
}
return 0;
}