Pagini recente » Cod sursa (job #338554) | Cod sursa (job #157958) | Cod sursa (job #191479) | Cod sursa (job #2730976) | Cod sursa (job #2149045)
#include <fstream>
#include <cstring>
#define nmax 2000002
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
char s[nmax];char z[nmax];
int t[nmax];int sol[1005],c=0;
int main()
{
fin>>z+1;
fin>>s+1;
int m;
int k=0;
int i=2;
for(i=2;z[i]!=NULL;i++)
{
while(z[k+1]!=z[i]&&k)
k=t[k];
if(z[k+1]==z[i])
k++;
t[i]=k;
}
m=i-1;
k=0;
for(int i=2;s[i]!=NULL;i++)
{
while(z[k+1]!=s[i]&&k)
k=t[k];
if(z[k+1]==s[i])
k++;
if(k==m)
{
k=t[k];
c++;
if(c<=1000)
{
sol[c]=i-m;
}
}
}
fout<<c<<"\n";
for(int i=1;i<=min(1000,c);i++)
fout<<sol[i]<<" ";
return 0;
}