PAT1068

最新推荐文章于 2023-02-14 22:29:29 发布

douglaslee01

最新推荐文章于 2023-02-14 22:29:29 发布

阅读量270

点赞数 1

分类专栏： pat

本文链接：https://blog.csdn.net/douglaslee01/article/details/79984311

版权

pat 专栏收录该内容

7 篇文章 0 订阅

订阅专栏

1068. Find More Coins (30)

时间限制

150 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

Eva loves to collect coins from all over the universe, including some other planets like Mars. One day she visited a universal shopping mall which could accept all kinds of coins as payments. However, there was a special requirement of the payment: for each bill, she must pay the exact amount. Since she has as many as 10⁴ coins with her, she definitely needs your help. You are supposed to tell her, for any given amount of money, whether or not she can find some coins to pay for it.

Input Specification:

Each input file contains one test case. For each case, the first line contains 2 positive numbers: N (<=10⁴, the total number of coins) and M(<=10², the amount of money Eva has to pay). The second line contains N face values of the coins, which are all positive numbers. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print in one line the face values V₁ <= V₂ <= ... <= V_k such that V₁ + V₂ + ... + V_k = M. All the numbers must be separated by a space, and there must be no extra space at the end of the line. If such a solution is not unique, output the smallest sequence. If there is no solution, output "No Solution" instead.

Note: sequence {A[1], A[2], ...} is said to be "smaller" than sequence {B[1], B[2], ...} if there exists k >= 1 such that A[i]=B[i] for all i < k, and A[k] < B[k].

Sample Input 1:

8 9
5 9 8 7 2 3 4 1

Sample Output 1:

1 3 5

Sample Input 2:

4 8
7 2 4 3

Sample Output 2:

No Solution

题目要求：要从一串长度为N数中找出和为M的子序列，并且子序列应该使得各个位置上的数字尽可能小

解题思路：首先对所有的数字进行排序，如果本来总和都没有M大，那么就NoSolution，然后进行一下递归求解，如果solve(i,left)(left是指剩下的子序列长度，i是第几小的数字)，如果该数等于left就ok，大于就false弹出自己，小于就继续搜，如果搜到就ok，搜完了后面的全部都没有搜到就说明自己这个数不行，把自己弹出。

bool solve(int num,int layer){
    st.push(layer);
    if(num==input[layer]){
        return true;
    }
    else if(num<input[layer]){
        st.pop();
        return false;
    }
    else{
        for(int k=layer+1;k<a;k++){
        if(solve(num-input[layer],k))
            return true;
        }
        st.pop();
        return false;
    }
}