不想再WA了

版权声明：来自星空计算机团队(QQ群：134826825)——申屠志刚 https://blog.csdn.net/weixin_43272781/article/details/85398773

https://ac.nowcoder.com/acm/contest/322/G

题解：预处理，给我搜，暴力就完事了

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,q,ans;
int a[N];
char str;
void dfs(int x,int c){
    if(n<=c){
        ans++;
        return ;
    }
    if(x==3){
        dfs(2,c+1);
        dfs(3,c+1);
    }else{
     dfs(1,c+1);
    dfs(2,c+1);
    dfs(3,c+1);
    }

}
int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    for(int i=1;i<=10;i++){
        ans=0;
        n=i;
        dfs(0,0);
        a[i]=ans;
        //cout << ans << endl;

    }

    scanf("%d",&t);
    //for(int i=1;i<=t)
    while(t--){
        scanf("%d",&n);
        cout << a[n]<< endl;
    }
    //cout << "Hello world!" << endl;
    return 0;
}