Pagini recente » Cod sursa (job #1134570) | Cod sursa (job #1277385) | Cod sursa (job #2317414) | Cod sursa (job #128554) | Cod sursa (job #1734769)
#include <fstream>
#include <cstring>
#define N 2000010
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
char a[N],b[N];
int na,nb,p[N],q,i,sol,x[1010];
int main()
{
f>>(a+1);
na=strlen(a+1);
f>>(b+1);
nb=strlen(b+1);
for(i=2;i<=na;i++)
{
while(q>0&&a[q+1]!=a[i])q=p[q];
if(a[q+1]==a[i])
q++;
p[i]=q;
}
for(i=1,q=0;i<=nb;i++)
{
while(q>0&&a[q+1]!=b[i])q=p[q];
if(a[q+1]==b[i])
q++;
if(q==na)
{
sol++;
if(sol<=1000)
x[sol]=i-na;
}
}
g<<sol<<'\n';
sol=min(sol,1000);
for(i=1;i<=sol;i++)
g<<x[i]<<" ";
return 0;
}