Pagini recente » Cod sursa (job #2207233) | Cod sursa (job #2179397) | Cod sursa (job #240950) | Monitorul de evaluare | Cod sursa (job #2359720)
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
char a[2000002];char b[2000002];
int ans[1001],K=0;
int n,m;unsigned int q[2000002];
void INIQ()
{
q[1]=0;int j=0;
for(int i=2;i<=n;++i)
{
while(a[j+1]!=a[i]&&j>0)j=q[j];
if(a[j+1]==a[i])++j;
q[i]=j;
}
}
int main()
{
a[0]=b[0]=' ';
f>>(a+1)>>(b+1);
n=strlen(a);--n;
m=strlen(b);--m;
INIQ();
for(int i=1,j=0;i<=m;++i)
{
while(a[j+1]!=b[i]&&j>0)j=q[j];
if(a[j+1]==b[i]){++j;if(j==n){j=q[j];++K;if(K<=1000)ans[K]=i-n;}}
}
g<<K<<'\n';
for(int i=1;i<=K;++i){g<<ans[i]<<' ';}
}