标签:utopian tree
#include <iostream>
using namespace std;
int height(int n) {
if(n == 0)
return 1;
else
{
if(n % 2 == 0)
return height(n - 1)+1;
else
return height(n - 1)*2;
}
return 0;
}
int main() {
int T;
cin >> T;
while (T--) {
int n;
cin >> n;
cout << height(n) << endl;
}
}标签:utopian tree
原文地址:http://9320314.blog.51cto.com/9310314/1558247