蟠桃记——递归

//Createdby朱正天on2017/8/12.//如何继续处理非2数#include<iostream>#include<cmath>#include<cstdio>#include<sstream>#include<cstring>#include<vector>#include<algorithm>#include<set>#include <windef.h>using namespace std;#define N 10#define ROW 6#define COL 6int a[N]={-1};int c[N]={0};int dp[N][N]={0};//http://acm.hdu.edu.cn/showproblem.php?pid=2013//http://acm.hdu.edu.cn/discuss/problem/post/reply.php?postid=31180&messageid=1&deep=0//#include<stdio.h>//#include<stdlib.h>////int f(int n, int x)//{//    if (n == 1)//    {//        return  x;//    }//    else//    {//        return f(n - 1, (x + 1) * 2);//    }//}//int main()//{//    int num;//    while (scanf("%d", &num) != EOF)//    {//        printf("%d\n", f(num, 1));//    }////    return 0;//}int main(){//    freopen("F:\\Coding\\c.txt", "r", stdin);    //初始化////    int n=0,v=0;//    cin>>n>>v;//    for (int i = 0; i <n ; ++i) {//        cin>>c[i];//    }    int t=0;    cin>>t;    int n=0;    while(t--){        cin>>n;        int sum=1;        for (int i = n; i >1 ; --i) {            sum=(sum+1)*2;        }        cout<<sum<<endl;    }    return 0;}