Pagini recente » Cod sursa (job #2361314) | Cod sursa (job #1484953) | Cod sursa (job #389637) | Cod sursa (job #754927) | Cod sursa (job #1567797)
#include<fstream>
#include<string.h>
#define N 2000001
using namespace std;
ifstream in("strmatch.in");
ofstream out("strmatch.out");
int i,l1,l2,len,cnt,x[1001],p[N];
char s1[N],s2[N];
int main(){
in>>s1+1;
in>>s2+1;
l1=strlen(s1+1);
l2=strlen(s2+1);
for(i=2;i<=l1;++i)
{
while(len && s1[len+1]!=s1[i])
len=p[len];
if(s1[len+1]==s1[i])
++len;
p[i]=len;
}
len=0;
for(i=1;i<=l2;++i)
{
while(len && s1[len+1]!=s2[i])
len=p[len];
if(s1[len+1]==s2[i])
++len;
if(len==l1){
++cnt;
if(cnt<=1000) x[cnt]=i-len;
len=p[l1];
}
}
out<<cnt<<'\n';
int t=min(cnt,1000);
for(i=1;i<=t;++i)
out<<x[i]<<' ';
return 0;
}