BestCoder Round #49 HDU5339 Untitled

Untitled

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

Problem Description

There is an integer  a  and  n  integers  b1,…,bn . After selecting some numbers from  b1,…,bn  in any order, say  c1,…,cr , we want to make sure that  a mod c1 mod c2 mod… mod cr=0  (i.e.,  a  will become the remainder divided by  ci  each time, and at the end, we want  a  to become  0 ). Please determine the minimum value of  r . If the goal cannot be achieved, print  −1  instead.

 

Input

The first line contains one integer  T≤5 , which represents the number of testcases. 

For each testcase, there are two lines:

1. The first line contains two integers  n  and  a  ( 1≤n≤20,1≤a≤106 ).

2. The second line contains  n  integers  b1,…,bn  ( ∀1≤i≤n,1≤bi≤106 ).

 

Output

Print  T  answers in  T  lines.

 

Sample Input

   
   

    
    2
2 9
2 7
2 9
6 7
   
   

 

Sample Output

   
   

    
    2
-1
   
   

 

Source

BestCoder Round #49 ($)

出题人：对于一组可能的答案$c$，如果先对一个觉小的c_ic​i​​取模，

再对一个较大的c_jc​j​​取模，那么这个较大的c_jc​j​​肯定是没有用的。

因此最终的答案序列中的$c$肯定是不增的。那么就枚举选哪些数字，

并从大到小取模看看结果是否是$0$就可以了。时间复杂度O(2^n)O(2​n​​).

#include 
   
   
    
    
#include
    
    
     
     
#include
     
     
      
      
using namespace std;
int b[100];
int flag;
int cmp(int l,int r)
{
    return l
      
      
       
       =r) return ;
    fang(sum,r,k,i-1);
    if(sum>=b[i])
    fang(sum%b[i],r,k+1,i-1);
}
int main()
{
    int t,i,j,n,a;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&a);
        for(i=0;i