HDoj 5665 Lucky【水】

Lucky
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 554    Accepted Submission(s): 327
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 
   
 
  

Statistic |  Submit |  Discuss |  Note
代码：

//           ！
/*
          s ，    ，                ，        ，  YES;
	    NO； 
  ：          0  ，0              ，  0   ，    
1  ，         1       ，  1    ，         0   1    ，  
       0 1           ，        ！ 
*/ 
#include 
#include 
#include 
using namespace std;
int a[100005];
int main()
{
	int T;
	scanf("%d",&T);
	while(T--)
	{
		int n;
		scanf("%d",&n);
		int flag1=0,flag2=0;
		for(int i=0;i