Pagini recente » Cod sursa (job #1042558) | Cod sursa (job #2803631) | Cod sursa (job #1178371) | Cod sursa (job #1270909) | Cod sursa (job #1966995)
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
#define nmax 2000005
char a[nmax], b[nmax];
int n, m, pi[nmax], nr=0, poz[1024];
void build()
{
int i, k;
k=0;
pi[1]=0;
for(i=2; i<=n; i++)
{
while(k!=0 && a[k+1]!=a[i])
k=pi[k];
if(a[k+1]==a[i])
k++;
pi[i]=k;
}
}
void deplaseaza()
{
int i;
n=strlen(a); m=strlen(b);
for(i=n; i>=1; i--)
a[i]=a[i-1];
for(i=m; i>=1; i--)
b[i]=b[i-1];
a[0]=b[0]=' ';
}
void numara()
{
int i, k;
k=0;
for(i=1; i<=m; i++)
{
while(k!=0 && a[k+1]!=b[i])
k=pi[k];
if(a[k+1]==b[i])
k++;
if(k==n)
{
k=pi[n];
nr++;
if(nr<=1000)
poz[nr]=i-n;
}
}
}
void afisare()
{
int i, n;
fout<<nr<<'\n';
n=min(1000, nr);
for(i=1; i<=n; i++)
fout<<poz[i]<<' ';
fout<<'\n';
fout.close();
}
void citire()
{
fin>>a>>b;
fin.close();
}
int main()
{
citire();
deplaseaza();
build();
numara();
afisare();
return 0;
}