Pagini recente » Cod sursa (job #2462241) | Cod sursa (job #1562624)
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
int n,m;
char t[2000005],p[2000005];
int sol[1005],nr;
int k;
int pi[2000005];
void prefix()
{
int i;
for(i=1;i<=m-1;i++)
{
while(k>0 && p[i]!=p[k])
{
k=pi[k-1];
}
if(p[k]==p[i])
{
k++;
}
pi[i]=k;
}
}
int main()
{
f>>p>>t;
n=strlen(t);
m=strlen(p);
prefix();
k=0;
int i;
for(i=1;i<=n-1;i++)
{
while(k>0 && t[i]!=p[k])
k=pi[k-1];
if(p[k]==t[i])
{
k++;
}
if(k==m)
{
nr++;
sol[i-m+1]=sol[i-m+1]+1;
}
}
g<<nr<<"\n";
for(i=1;i<=1000;i++)
{
if(sol[i]>0)
g<<i<<" ";
}
return 0;
}