题目很简单,有一个递推公式:a(n)=a(n-1)*3,a1=3.
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
int T;
int n;
long long s;
cin >> T;
while (T--)
{
cin >> n;
s = pow(3, n);
cout << s << endl;
}
return 0;
}