递归求解,根据题目中的变量和叙述给出递归的关系式
AC 代码如下
#include<iostream>
using namespace std;
//#include<cmath>
//#include<iomanip>
int recursion(int left, int count, int total)
{
if (count == total)
{
return left;
}
else
{
return recursion(2 * (left - 1), count + 1, total);
}
}
int main()
{
int n;
int i = 0;
while (cin>>n)
{
int *arr = new int[n];
i = 0;
while (i < n)
{
cin >> arr[i];
cout << recursion(3, 0, arr[i]) << endl;
i++;
}
}
//system("pause");
return 0;
}