Pagini recente » Cod sursa (job #2409349) | Cod sursa (job #998164) | Cod sursa (job #98900) | Cod sursa (job #2598510) | Cod sursa (job #2114950)
#include <iostream>
#include <fstream>
#include <cstring>
#include <vector>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
char x[2000000],y[2000000];
int *d;
int *pi;
vector<int> nr;
int main()
{
f>>x;
f>>y;
int n=strlen(x);
int m=strlen(y);
d=new int[m+1];
pi=new int[n+1];
int k=0;
pi[1]=0;
for(int i=n;i>0;i--)
{x[i]=x[i-1];
pi[i]=0;
}
for(int i=m;i>0;i--)
y[i]=y[i-1];
for(int i=2;i<=n;i++)
{
while(k&&x[i]!=x[k+1])
k=pi[k];
if(x[k+1]==x[i])k++;
pi[i]=k;
}
k=0;
for(int i=1;i<=m;i++)
{
while(k && y[i]!=x[k+1])
k=pi[k];
if(y[i]==x[k+1])
k++;
d[i]=k;
if(k==n)
{
nr.push_back(i-n);
}
}
g<<nr.size()<<"\n";
for(int i=0;i<nr.size();i++)
g<<nr[i]<<" ";
return 0;
}