BestCoder Round #49 ($) 1001

Problem Description

There is an integer $a$ and $n$ integers b1,…,bnb_1, \ldots, b_nb​1​​,…,b​n​​. After selecting some numbers from b1,…,bnb_1, \ldots, b_nb​1​​,…,b​n​​ in any order, say c1,…,crc_1, \ldots, c_rc​1​​,…,c​r​​, we want to make sure that a mod c1 mod c2 mod… mod cr=0a \ mod \ c_1 \ mod \ c_2 \ mod \ldots \ mod \ c_r = 0a mod c​1​​ mod c​2​​ mod… mod c​r​​=0 (i.e., $a$ will become the remainder divided by cic_ic​i​​ 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\le 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≤1061 \leq n \leq 20, 1 \leq a \leq 10^61≤n≤20,1≤a≤10​6​​).

2. The second line contains $n$ integers b1,…,bnb_1, \ldots, b_nb​1​​,…,b​n​​ (∀1≤i≤n,1≤bi≤106\forall 1\leq i \leq n, 1 \leq b_i \leq 10^6∀1≤i≤n,1≤b​i​​≤10​6​​).

Output

Print $T$ answers in $T$ lines.

Sample Input

2
2 9
2 7
2 9
6 7

Sample Output

2
-1

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#define LL long long
#define INF 0x3f3f3f3f

using namespace std;
bool vis[25];
int b[21];
int n;
int ant;

void DFS(int pos,int a,int step)
{
    if(pos < 0 || pos >=n || vis[pos])
        return ;
    if(ant <= step)
        return ;
    if(a%b[pos] == 0)
    {
        if(ant > step + 1)
            ant = step + 1;
        return ;
    }
    vis[pos] = true;
    DFS(pos + 1, a%b[pos], step+1);
    DFS(pos - 1, a%b[pos], step+1);
    vis[pos] = false;
    DFS(pos + 1,a,step);
}

int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        memset(vis,false,sizeof(vis));
        bool flag = false;
        int a;
        ant = INF;
        scanf("%d%d",&n,&a);
        for(int i=0; i<n; i++)
        {
            scanf("%d",&b[i]);
            if(a % b[i] == 0)
            {
                flag = true;
            }
        }
        if(!flag)
        {

            DFS(0,a,0);
            if(ant == INF)
                cout<<-1<<endl;
            else
                cout<<ant<<endl;
        }
        else
        {
            cout<<1<<endl;
        }
    }
    return 0;
}