Educational Codeforces Round 34 div2 Hungry Student Problem 简单dfs
来源:互联网 发布:蓝光碟播放软件 编辑:程序博客网 时间:2024/05/17 03:52
Hungry Student Problem
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.
#include<cstdio>#include<iostream>using namespace std;bool dfs(int n){ if(n<=0)return 0; if(n%7==0||n%3==0||n%10==0&&n){ return 1;} else { dfs(n-3); dfs(n-7); }}int main(){ int t; scanf("%d",&t); while(t--) { int n; scanf("%d",&n); if(dfs(n)) cout<<"YES"<<endl; else cout<<"NO"<<endl; }}
- Educational Codeforces Round 34 div2 Hungry Student Problem 简单dfs
- codeforces 903A.Hungry Student Problem
- A. Hungry Student Problem
- Educational Codeforces Round 5-C. The Labyrinth(简单dfs)
- Educational Codeforces Round 34
- 【题解】[codeforces round #198 div2]Tourists problem
- Educational Codeforces Round 34 题解
- Educational Codeforces Round 15(简单题)
- Codeforces Round #351 Div2 C 简单枚举
- Educational Codeforces Round 1 D.Igor In the Museum(DFS)
- Educational Codeforces Round 5 C The Labyrinth DFS
- Educational Codeforces Round 5(C)(DFS+hash)
- Educational Codeforces Round 5 C. The Labyrinth (DFS **)
- Educational Codeforces Round 6(E)DFS序,线段树
- CF Educational Codeforces Round 6 E题 dfs+线段树
- Educational Codeforces Round 22 C. The Tag Game dfs
- Educational Codeforces Round 25 G. Tree Queries(dfs)
- Educational Codeforces Round 31 C. Bertown Subway dfs
- 深入理解c语言——‘\\0’ ,‘0’, “0” ,0之间的区别
- 压测和防止压测方案
- select2 api参数的文档
- Linux JDK 安装
- 2017 秋校招经历记录
- Educational Codeforces Round 34 div2 Hungry Student Problem 简单dfs
- webview全面讲解
- 架构必须要考虑的问题
- 【关于Git】历史提交的合并
- 学习总结7
- STRUTS2.xml配置文件中action里的name和method用途解析
- LightOJ
- 考研路茫茫――单词情结
- Map.putAll(Map<? extends String, ? extends Object> m)方法