Educational Codeforces Round 34 (Rated for Div. 2) - A.Hungry Student Problem

1. 문제

2. 알고리즘

키워드 - 구현 

3. 코드

#include <iostream>
#include <vector>
using namespace std;
 
int main()
{
    int n;  cin >> n;
 
    vector<int> arr(n);
    for (int i = 0; i<n; i++)
        cin >> arr[i];
 
    for (int i = 0; i < n; i++) {
        bool bFind = false;
 
        for (int a = 0; a<=33; ++a) {
            int tmp = (arr[i] - 3 * a);
            if (tmp < 0)
                break;
 
            if (tmp % 7 == 0) {
                bFind = true;
                break;
            }
        }
 
        if(bFind)
            cout << "YES" << endl;
        else 
            cout << "NO" << endl;
    }
 
 
    return 0;
}