BestCoder Round #49 ($) HDOJ5339 Untitled(dfs)

GKHack

于 2015-08-09 10:05:56 发布

阅读量1k

点赞数 1

CC 4.0 BY-SA版权

分类专栏：深度优先搜索(dfs) BestCoder HDOJ

本文链接：https://blog.csdn.net/GKHack/article/details/47373599

HDOJ 同时被 3 个专栏收录

78 篇文章

订阅专栏

深度优先搜索(dfs)

29 篇文章

订阅专栏

BestCoder

29 篇文章

订阅专栏

本文探讨了使用排序和深度优先搜索（DFS）解决特定类型问题的方法，详细介绍了输入输出格式、实例输入输出以及AC代码实现，适用于算法与数据结构领域的学习与实践。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

T answers in

T lines.

Sample Input

Sample Output

2
-1

排序后dfs～

AC代码：

#include "iostream"
#include "cstdio"
#include "cstring"
#include "algorithm"
using namespace std;
const int inf = 0x3f3f3f3f;
int n, a, b[300], ans;
bool cmp(int a, int b)
{
    return a > b;
}
void dfs(int x, int num, int A)
{
    if(!x) {
        ans = min(ans, A);
        return;
    }
    if(num == n) return;
    dfs(x % b[num + 1], num + 1, A + 1);
    dfs(x, num + 1, A);
}
int main(int argc, char const *argv[])
{
    int t;
    scanf("%d", &t);
    while(t--) {
        scanf("%d%d", &n, &a);
        for(int i = 1; i <= n; ++i)
            scanf("%d", &b[i]);
        sort(b + 1, b + 1 + n, cmp);
        ans = inf;
        dfs(a, 0, 0);
        if(ans == inf) printf("-1\n");
        else printf("%d\n", ans);
    }
    return 0;
}