玲珑杯 C -- Coco

C -- Coco

Time Limit：1s Memory Limit：64MByte

Submissions：262Solved：125

DESCRIPTION

Coco just learned a math operation call mod.Now,there is an integer $a$ and $n$ integers $b_1,\dots ,b_n$. After selecting some numbers from $b_1,\dots ,b_n$ in any order, say $c_1,\dots ,c_r$, Coco want to make sure that $amod{c}_{1}mod{c}_{2}mod\dots mod{c}_r=0$\ (i.e., $a$ will become the remainder divided by $c_i$ each time, and at the end, Coco 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(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\le n\le 20,1\le a\le {10}^6$).2. The second line contains $n$ integers $b_1,\dots ,b_n$\ ( $\forall 1\le i\le n,1\le b_i\le {10}^6$).

OUTPUT

Print $T$ answers in $T$ lines.

SAMPLE INPUT

22 92 72 96 7

SAMPLE OUTPUT

2-1

SOLUTION

玲珑杯”ACM比赛 Round #5

这道题第一次用的DP，完全背包的思路写的，结果超内存，改成滚动数组又超时。后来想了想，觉得枚举往下搜索一下应该也行，结果BFS一下就过了。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <queue>
#include <algorithm>
#define mem(p,k) memset(p,k,sizeof(p))
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define inf 0x5fffffff
#define LL long long
using namespace std;
int b[25];
struct SD {
    int c,m;
}f,p;
queue<struct SD> a;
bool cmp(int a,int b){
    return a>b;
}
int main(){
    int t;
    cin>>t;
    while(t--){
        int n,k,j,i,cur=0;
        cin>>n>>k;
        for(int i=0;i<n;i++)scanf("%d",b+i);
        sort(b,b+n,cmp);
        while(!a.empty())a.pop();
        f.m=k;f.c=0;//cout<<f.m;
        a.push(f);
        while(!a.empty()){
            f=a.front();
            a.pop();
            for(i=0;i<n;i++){//cout<<f.m<<endl;
                if(f.m==b[i]){
                    cur=f.c+1;
                    break;
                }
                if(b[i]<f.m){//因为余数下降，被除数必定小于除数，所以往下枚举就行了
                    p.m=f.m%b[i];
                    p.c=f.c+1;
                    a.push(p);
                }
            }
            if(cur)break;
        }
        if(cur)cout<<cur<<endl;
        else cout<<-1<<endl;
    }
    return 0;
}