Pagini recente » Cod sursa (job #437110) | Istoria paginii runda/simv_2 | Cod sursa (job #1044045) | Cod sursa (job #2600644) | Cod sursa (job #2395405)
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
int n,m,i,j,p[2000005],k,sol[2000005],nr;
char a[2000005],b[2000005];
int main()
{
f>>(a+1);
f>>(b+1);
n=strlen(a+1);
m=strlen(b+1);
k=0;
for(i=2; i<=n; i++)
{
while(a[k+1]!=a[i]&&k!=0) k=p[k];
if(a[k+1]==a[i]) k++;
p[i]=k;
}
k=0;
for(i=1; i<=m; i++)
{
while(a[k+1]!=b[i]&&k!=0) k=p[k];
if(a[k+1]==b[i]) k++;
if(k==n)
{
nr++;
sol[nr]=i-n;
//k=p[k];
}
}
g<<nr<<'\n';
for(i=1;i<=nr;i++) g<<sol[i]<<" ";
return 0;
}