#include<iostream>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<cstdlib>
#include<algorithm>
using namespace std;
char a[1005][1005];
int main()
{
int n;
a[0][0] = '1';
int before = 1;
for(int i = 1;i <= 100; ++i)
{
int k = 0;
int mod = 0;
for(int j = 0;j < before;++j)
{
a[i][k++] = ((a[i - 1][j] - '0') * 2 + mod) % 10+48;
mod = (((a[i - 1][j] - '0') * 2) + mod) / 10;
}
if(mod)
a[i][k++] = mod + 48;
before=k;
}
while(cin>>n)
{
int len=strlen(a[n]);
for(int i=len-1;i>=0;--i)
cout<<a[n][i];
cout<<endl;
}
}
高精度计算2的n次幂
最新推荐文章于 2024-07-15 19:39:34 发布