对于一个整数N,计算2的N次方并在屏幕显示十进制结果。

(512<=N<=1024)

#include <string>
#include <iostream>
using namespace std;
 
string NPowerOf2(int n){
    string res("1");
 
    for( int i =0;i < n; ++i){
        int carry = 0, multi= 0;
        for(int j = res.size( )-1; j >= 0; --j){
            int tmpNum = res[j] - '0';
            multi= (tmpNum<<1) + carry;
            carry = multi/10; 
            res[j] = (multi%10) + '0';
        }
        if( carry> 0)
            res.insert(res.begin( ), carry+'0');
    }
    return res;
}
int main( )
{
    int n;
    while( cin>>n)
        cout<<NPowerOf2(n)<<endl;
    return 0;
}