Pagini recente » Cod sursa (job #2447089) | Cod sursa (job #1587619) | Cod sursa (job #1997056) | Cod sursa (job #1833944) | Cod sursa (job #2095146)
#include <fstream>
#include <cstring>
using namespace std;
#define nm 2000003
char a[nm],b[nm];
int p[nm],lga,lgb,i,q,pos[1002],lg=0;
int main()
{
ifstream f("strmatch.in");
ofstream g("strmatch.out");
f>>a+1>>b+1;
lga=strlen(a+1);
lgb=strlen(b+1);
q=0;
for(i=2; i<=lga; i++)
{
while(q&&a[q+1]!=a[i])
q=p[q];
if(a[q+1]==a[i])
++q;
p[i]=q;
}
q=0;
for(i=1; i<=lgb; i++)
{
while(q&&a[q+1]!=b[i])
q=p[q];
if(a[q+1]==b[i])
q++;
if(q==lga)
{
lg++;
if(lg<=1000)
pos[lg]=(i-lga);
// q=p[q];
}
}
g<<lg<<'\n';
if(lg>1000) lg=1000;
for(i=1;i<=lg;i++)
g<<pos[i]<<" ";
}