Pagini recente » Cod sursa (job #1873282) | Cod sursa (job #1254696) | Cod sursa (job #542372) | Cod sursa (job #3280532) | Cod sursa (job #2351775)
#include <bits/stdc++.h>
#define DMAX 2000010
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
char a[DMAX],b[DMAX];
int vala[DMAX],valb[DMAX];
vector <int> sol;
int k,n,m,solutii;
void citire();
int main()
{int i;
citire();
k=0;
n=strlen(a+1);
for(i=2;i<=n;i++)
{while(a[k+1]!=a[i] && k)
k=vala[k];
if(a[k+1]==a[i])
k++;
vala[i]=k;
}
m=strlen(b+1);
if(b[1]==a[1])
{valb[1]=1;
k=1;
}
else
k=0;
for(i=2;i<=m;i++)
{while(a[k+1]!=b[i] && k)
k=vala[k];
if(a[k+1]==b[i])
k++;
valb[i]=k;
if(k==n && sol.size()<1000)
{sol.push_back(i-n);
solutii++;
}
else
if(k==n)
solutii++;
}
fout<<solutii<<'\n';
for(i=0;i<sol.size();i++)
fout<<sol[i]<<' ';
fout<<'\n';
return 0;
}
void citire()
{fin>>a+1;
fin>>b+1;
}