A-Hungry Student Problem

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

原创最新推荐文章于 2021-08-09 09:43:58 发布 · 369 阅读

0 ·

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

标签

#A-hungry student problem

Codeforces 专栏收录该内容

9 篇文章

订阅专栏

本文介绍了一个关于购买鸡块的趣味算法问题。主人公伊万希望在CFK咖啡店吃到指定数量的鸡块，但鸡块只以3块和7块为单位出售。文章提供了一段AC代码，通过枚举不同组合来判断是否能买到正好数量的鸡块。

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
2
6
5
output
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.

ac代码：

#include<stdio.h>
int T;
void fun(int x)
{
	if (x % 3 == 0 || x % 7 == 0)
	{
		printf("YES\n");
		return;
	}
	else
	{
		for (int i = 0; i <= x / 7; i++)
		{
			int x1 = x - 7 * i;
			if (x1 % 3 == 0)
			{
				printf("YES\n");
				return;
			}
		}
		printf("NO\n");
		return;
	}
}
int main()
{
	int n;
	scanf("%d", &T);
	while (T--)
	{
		scanf("%d", &n);
		fun(n);
	}
	return 0;
}

我只会简单题，太菜，也不知道又没有人看