题目:http://www.luogu.org/problem/show?pid=1045#
分析:高精度+快速幂
代码:
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;
const int Tmax=510;
int p,ans[Tmax],tmp[Tmax],st[Tmax];
void mul(int *a,int *b,int *c)
{
int i,j,la=min(a[0],500),lb=min(b[0],500);
memset(tmp,0,sizeof(tmp));
for(i=1;i<=la;i++)
for(j=1;j<=lb;j++)
if(i+j-1<=500)
tmp[i+j-1]+=a[i]*b[j];
i=1;
while(tmp[i]!=0&&i<=500)
{
tmp[i+1]+=tmp[i]/10;
tmp[i]%=10;
i++;
}
tmp[0]=i-1;
memcpy(c,tmp,sizeof(tmp));
return;
}
void quick()
{
st[1]=2;
st[0]=1;
ans[1]=ans[0]=1;
while(p>0)
{
if(p&1==1) mul(ans,st,ans);
p>>=1;
mul(st,st,st);
}
return;
}
int main()
{
int i;
scanf("%d",&p);
printf("%d",(int)(log(2)/log(10)*(1.0*p))+1);
quick();
ans[1]--;i=1;
while(ans[i]<0)
{
ans[i]+=10;
ans[i+1]-=1;
i++;
}
for(i=500;i>=1;i--)
{
if(i%50==0) printf("\n");
printf("%d",ans[i]);
}
return 0;
}