Educational Codeforces Round 34 A. Hungry Student Problem

最新推荐文章于 2021-08-09 09:43:58 发布

转载最新推荐文章于 2021-08-09 09:43:58 发布 · 372 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

原文链接：http://www.cnblogs.com/youchandaisuki/p/8825641.html

本文介绍了一个简单的编程问题——CFK鸡块问题。问题中，主人公Ivan想要在CFK咖啡馆吃正好x块鸡块，而鸡块只提供3块和7块两种份量。文章通过遍历所有可能的组合来判断Ivan是否能买到他想要的确切数量的鸡块，并给出了相应的代码实现。

Ivan's classes at the university have just finished, and now he wants to go to the local CFK cafe and eat some fried chicken.

CFK sells chicken chunks in small and large portions. A small portion contains 3 chunks; a large one — 7 chunks. Ivan wants to eat exactly x chunks. Now he wonders whether he can buy exactly this amount of chicken.

Formally, Ivan wants to know if he can choose two non-negative integers a and b in such a way that a small portions and b large ones contain exactly x chunks.

Help Ivan to answer this question for several values of x!

Input

The first line contains one integer n (1 ≤ n ≤ 100) — the number of testcases.

The i-th of the following n lines contains one integer xi (1 ≤ xi ≤ 100) — the number of chicken chunks Ivan wants to eat.

Output

Print n lines, in i-th line output YES if Ivan can buy exactly xi chunks. Otherwise, print NO.

Example

input

Copy

2
6
5

output

Copy

YES
NO

Note

In the first example Ivan can buy two small portions.

In the second example Ivan cannot buy exactly 5 chunks, since one small portion is not enough, but two small portions or one large is too much.

水题，会遍历一遍就行。

#include <bits/stdc++.h>

using namespace std;
#define maxn 100000
int n;
int a[maxn];
int b[maxn];



int main()
{
    int k=3,t=7;
    for(int i=0; i<=14; i++)
        for(int j=0; j<=33; j++)
        {
            b[k*i+t*j]=1;

        }
    b[0]=0;
    cin>>n;
    for(int i=0;i<n;i++)
        cin>>a[i];
    for(int i=0;i<n;i++)
    {
        if(!b[a[i]])
            cout<<"NO"<<endl;
        else
            cout<<"YES"<<endl;
    }

    return 0;
}

View Code

转载于:https://www.cnblogs.com/youchandaisuki/p/8825641.html