Pagini recente » Cod sursa (job #350814) | Cod sursa (job #1884933) | Cod sursa (job #2304190) | Cod sursa (job #1485063) | Cod sursa (job #2544263)
#include <bits/stdc++.h>
using namespace std;
char s1[100005];
char s2[100005];
const int mod=666013;
const int mod1=6524017;
int a[100005];
int b[100005];
int c[100005];
int main()
{
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);
gets(s1+1);gets(s2+1);
int n=strlen(s1+1),m=strlen(s2+1);
long long rez=0,put=1,put1=1;
int i;
int cnt=0;
for(i=1;i<=n;i++)
{
rez=rez*27+s1[i]-'A'+1;
if(i<n)put=put*27;
put=put%mod;
rez%=mod;
}
long long rez1=0;
for(i=1;i<=n;i++)
{
rez1=rez1*27+s1[i]-'A'+1;
if(i<n)put1=put1*27;
put1=put1%mod;
rez1%=mod1;
}
long long calc=0,calc1=0;
for(i=1;i<=n;i++)
{
calc=calc*27+s2[i]-'A'+1;
calc%=mod;
calc1=calc1*27+s2[i]-'A'+1;
calc1%=mod1;
if(calc==rez&&calc1==rez1)cnt++,a[cnt]=0;
}
for(i=n+1;i<=m;i++)
{
calc-=put*(s2[i-n]-'A'+1);
calc1-=put1*(s2[i-n]-'A'+1);
calc%=mod;
calc1%=mod1;
if(calc<0)calc+=mod;
if(calc1<0)calc1+=mod1;
calc*=27;
calc1*=27;
calc+=s2[i]-'A'+1;
calc1+=s2[i]-'A'+1;
calc%=mod;
calc1%=mod1;
if(calc==rez&&calc1==rez1)cnt++,a[cnt]=i-1;
}
cout<<cnt<<"\n";
for(i=1;i<=cnt;i++)cout<<a[i]-n+1<<" ";
return 0;
}