2的N次方

Description:

编程精确计算2的N次方。（N是介于100和1000之间的整数）。

Input:

正整数N (100≤N≤1000)

Output:

2的N次方

Sample Input:

200

Sample Output:

1606938044258990275541962092341162602522202993782792835301376

Note:

本题由旧版NOJ导入，来源：NUPT

 

#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <climits>
#include <stdio.h>
#include <iomanip>
#include <math.h>   
#include <list>
#include <tuple> 
#include <stack>
#include <string.h>
using namespace std;

string addStrings(string num1, string num2) 
    {
        int size1 = num1.size();
        int size2 = num2.size();
        if(size2 < size1)
        {
            for(int i = 0; i < (size1-size2)+1; i++)
                num2 = '0'+num2;
            num1 = '0'+num1;
        }
        else if(size1 < size2)
        {
            for(int i = 0; i < (size2-size1)+1; i++)
                num1 = '0'+num1;
            num2 = '0'+num2;
        }
        else
        {
            num1 = '0'+num1;
            num2 = '0'+num2;
        }
        int size = max(size1, size2);
        int i = 0;
        int jinwei = 0;
        string ret;
        for(i = size;  i >= 0; i--)
        {
            int a = num1[i]-'0';
            int b = num2[i]-'0';
            
                
            int sum = a + b + jinwei;
            if(sum >= 10)
                jinwei =  1;
            else
                jinwei = 0;
            sum %= 10;
            ret = std::to_string(sum) + ret;
        }
        if(ret[0] == '0')
            ret.erase(0,1);
        return ret;
    }


int main(void)
{
	int n;
	cin >> n;
	string ret = "1";
	for(;n--;)
	{
		ret = addStrings(ret, ret);
	}
	cout << ret << endl;
	return 0;

}