Pagini recente » Cod sursa (job #853678) | Cod sursa (job #612118) | Cod sursa (job #895882) | Cod sursa (job #3168004) | Cod sursa (job #2128874)
#include <fstream>
#include <cstring>
#define LMAX 2000002
using namespace std;
ifstream f("s.in");
ofstream g("s.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++;
if(sol==1000)
break;
}
g<<sol<<endl;
for(int i=1;i<=m;i++)
{
if(d[i]==n && sol>0)
{
g<<i-n<<" ";
}
if(sol==0)
break;
}
return 0;
}