Codeforces 903A A - Hungry Student Problem 规律

有规律，推一下

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<stack>
#include<map>
#define PI acos(-1.0)
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)
#define kuaidian ios::sync_with_stdio(0);

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 1e6, maxd = 1000 + 7;
const ll mod = 1e9 + 7;
const int INF = 0x7f7f7f7f;

int n, m;

int a[111] = {0,0,0,1,0,0,1,1,0,1,1,0};

int main() {
    kuaidian;

    int t;
    cin >> t;
    while(t--) {
        int n;
        cin >> n;
        if(n <= 11) {
            if(a[n] == 0) cout << "NO" << endl;
            else cout << "YES" << endl;
        }
        else cout << "YES" << endl;
    }


    return 0;
}