#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
using namespace std;
int p;
int res[1010],f[1010],sav[1010],n,len=1;
void mc1()
{
memset(sav,0,sizeof(sav));
for(int i=1;i<=500;i++)
for(int j=1;j<=500;j++)
sav[i+j-1]+=res[i]*f[j];
for(int i=1;i<=500;i++)
{
sav[i+1]+=sav[i]/10;
sav[i]%=10;
}
memcpy(res,sav,sizeof(res));
}
void mc2()
{
memset(sav,0,sizeof(sav));
for(int i=1;i<=500;i++)
for(int j=1;j<=500;j++)
sav[i+j-1]+=f[i]*f[j];
for(int i=1;i<=500;i++)
{
sav[i+1]+=sav[i]/10;
sav[i]%=10;
}
memcpy(f,sav,sizeof(f));
}
int main(){
scanf("%d",&p);
printf("%d\n",(int)(log10(2)*p+1));
res[1]=1;
f[1]=2;
while (p!=0){
if (p%2==1) mc1();
p/=2;
mc2();
}
res[1]-=1;
for (int i=1;i<=10;i++){
for (int j=1;j<=50;j++){
printf("%d",res[500-(i-1)*50-j+1]);
}
printf("\n");
}
return 0;
}
洛谷 P1045 麦森数(高精快速幂)
于 2022-12-31 13:24:35 首次发布