双塔问题

#include <cstdio>
#include <cstring>
const int N=100;
int a[N],t[N],s[N],c1[N];
int n;
void mult (int a[N],int la,int b[N],int lb,int c[N],int &lc){
memset(c1,0,sizeof c1);
//a*b==>c1
for(int i=0;i<la;++i)
for(int j=0;j<lb;++j){
c1[i+j]+=a[i]*b[j];
c1[i+j+1]+=c1[i+j]/10;
c1[i+j]%=10;
}
//处理c1的长度
lc=la+lb;
while(lc>1 and c1[lc-1]==0) lc--;
for(int i=0;i<lc;++i) c[i]=c1[i];
}
int main(){
//freopen("caioj1331.in","r",stdin);
//freopen("caioj1331.out","w",stdout);
scanf("%d",&n);
//调整n
++n;
//把n转成二进制，存到a数组里
int l=0;
while(n>0){
++l;
a[l]=n%2;
n/=2;
}
//初始化t数组
memset(t,0,sizeof t);
t[0]=2;
int lt=1;
//初始化s数组
memset(s,0,sizeof s);
if(a[1]==0) s[0]=1;
else s[0]=2;
int ls=1;

//循环倍增
for(int i=2;i<=l;++i){
//将t（数组）翻倍
mult(t,lt,t,lt,t,lt);
if(a[i]==1) mult(s,ls,t,lt,s,ls);
}
//输出s
s[0]-=2;
for(int i=ls-1;i>=0;--i) printf("%d",s[i]); 
return 0;
}