HDU 5665 Lucky

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

112

 

Sample Output

NO
简单题，判断有没有0和1即可
#pragma comment(linker, "/STACK:102400000,102400000")#include<map>#include<set>#include<cmath>#include<queue>#include<stack>#include<bitset>#include<cstdio>#include<string>#include<cstring>#include<iostream>#include<algorithm>#include<functional>using namespace std;typedef long long LL;const int low(int x) { return x&-x; }const int INF = 0x7FFFFFFF;const int mod = 1e9 + 7;const int maxn = 2e5 + 10;int T, n, m;int main(){    scanf("%d", &T);    while (T--)    {        scanf("%d", &n);        int f1 = 0, f2 = 0, x;        while (n--)        {            scanf("%d", &x);            if (x == 0) f1 = 1;            if (x == 1) f2 = 1;        }        printf("%s\n", f1&&f2 ? "YES" : "NO");    }    return 0;}