wpb学长上楼梯

题目链接：http://acm.henu.edu.cn/contest/problem?id=2&pid=8

#include<iostream>
#include<math.h>
#include<algorithm>
#include<cstring>
#include<queue>
long long n;

using namespace std;
int main (){
	int T;
	cin >> T;
	while(T--)
	{
		cin >> n;
		long long dp[n+1];
		memset(dp, 0, sizeof(dp)); 
		dp[0] = 1;
		dp[1] = 1;
		dp[2] = 2;
		dp[3] = 4;

		for(int i = 4; i <= n; i++)
		{
			 dp[i] = 2 * dp[i-1];
		}
		cout << dp[n] << endl;
	}
	return 0;
}