Pagini recente » Cod sursa (job #699594) | Cod sursa (job #2539073) | Cod sursa (job #2692200) | Cod sursa (job #68651) | Cod sursa (job #897823)
Cod sursa(job #897823)
#include<cstdio>
#include<cstring>
#include<vector>
using namespace std;
int a1,a2,b1,b2,bz=97,m1=666013,m2=666019,p1=1,p2=1,l1,l2,nr=1000;
vector <int> s;
char a[2000002],b[2000002];
int main()
{
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);
gets(a);
gets(b);
l1=strlen(a);
l2=strlen(b);
for(int i=1;i<l1;++i)
{
p1=(p1*bz)%m1;
p2=(p2*bz)%m2;
}
if(l1>l2){printf("0\n");return 0;}
for(int i=0;i<l1;++i)
{
a1=(a1*bz+a[i])%m1;
a2=(a2*bz+a[i])%m2;
b1=(b1*bz+b[i])%m1;
b2=(b2*bz+b[i])%m2;
}
if(a1==b1&&a2==b2) s.push_back(0);
for(int i=l1;i<l2;++i)
{
b1=((b1-(p1*b[i-l1])%m1+m1)*bz+b[i])%m1;
b2=((b2-(p2*b[i-l1])%m2+m2)*bz+b[i])%m2;
if(a1==b1&&a2==b2) s.push_back(i-l1+1);
}
printf("%d\n",s.size());
if(s.size()<1000) nr=s.size();
for(int i=0;i<nr;++i)
printf("%d ",s[i]);
printf("\n");
fclose(stdin);fclose(stdout);
return 0;
}