BestCoder #80 1001 HDU5665

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

Output

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

Sample Input

Copy
1
1
2

Sample Output

NO

集合中只要有0和1就可以组合成所有数

传送门

#include<iostream>using namespace std;int main(){    int T;    int n;    int num;    cin>>T;    while(T--){        cin>>n;        int flag1=0;        int flag2=0;        while(n--){            cin>>num;            if(num==1)                flag1=1;            if(num==0)                flag2=1;        }        if(flag1&&flag2)            cout<<"YES"<<endl;        else            cout<<"NO"<<endl;    }}