Pagini recente » Cod sursa (job #3286349) | Cod sursa (job #78113) | Cod sursa (job #2194470) | Cod sursa (job #2924815) | Cod sursa (job #2296421)
#include <fstream>
#include <cstring>
#include <vector>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
char N[2000002],M[2000002];
int n,m,k,q,i,sol,s[2000002],p[2000002];
int main(){
fin>>N+1;for(i=1;N[i];i++);n=i-1;
fin>>M+1;for(i=1;M[i];i++);m=i-1;
for(i=2;i<=n;i++)
{
while(k>0&&N[k+1]!=N[i])k=p[k];
if(N[k+1]==N[i]) k++;
p[i]=k;
}
for(i=1;i<=m;i++)
{
while(q>0&&N[q+1]!=M[i])q=p[q];
if(N[q+1]==M[i]) q++;
if(q==n) s[++sol]=i-n;
}
fout<<sol<<"\n";
for(i=1;i<=sol&&i<=1000;i++) fout<<s[i]<<" ";
return 0;
}