hdu5665

hdu5665

Lucky

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 140    Accepted Submission(s): 97

Problem Description

Chaos August likes to study the lucky numbers.     For a set of numbers S,we set the minimum non-negative integer,which can't be gotten by adding the number in S,as the lucky number.Of course,each number can be used many times.     Now, given a set of number S, you should answer whether S has a lucky number."NO" should be outputted only when it does have a lucky number.Otherwise,output "YES".

Input

The first line is a number T,which is case number.     In each case,the first line is a number n,which is the size of the number set.     Next are n numbers,means the number in the number set.     1≤n≤105,1≤T≤10,0≤ai≤109.

Output

Output“YES”or “NO”to every query.

Sample Input

1 1 2

Sample Output

NO

Source

​​BestCoder Round #80​​

自然数，，，自然就包括0.。。脑子还是转的慢啊

今天BC第一题，没打补一下

#includeusing namespace std;int main(){ int T; scanf("%d",&T); while(T--){ int n; scanf("%d",&n); int k1=0,k2=0; for(int i=0;i

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。