zoukankan      html  css  js  c++  java
  • PAT 甲级 1068 Find More Coins

    https://pintia.cn/problem-sets/994805342720868352/problems/994805402305150976

    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 1coins 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 (≤, the total number of coins) and M (≤, 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 V1​​V2​​Vk​​ such that V1​​+V2​​++Vk​​=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 k1 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

    代码:

    #include <bits/stdc++.h>
    using namespace std;
    
    const int maxn = 1e4 + 10;
    int N, M;
    int num[maxn], dp[maxn];
    bool vis[maxn][110];
    
    int cmp(int a, int b) {
        return a > b;
    }
    
    int main() {
        scanf("%d%d", &N, &M);
        for(int i = 1; i <= N; i ++)
            scanf("%d", &num[i]);
        sort(num + 1, num + 1 + N, cmp);
    
        for(int i = 1; i <= N; i ++) {
            for(int j = M; j >= num[i]; j --) {
                if(dp[j] <= dp[j - num[i]] + num[i]) {
                    vis[i][j] = true;
                    dp[j] = dp[j - num[i]] + num[i];
                }
            }
        }
        if(dp[M] != M) printf("No Solution");
        else {
            vector<int> ans;
            int sum = M, st = N;
            while(sum > 0) {
                if(vis[st][sum]) {
                    ans.push_back(num[st]);
                    sum -= num[st];
                }
                st --;
            }
    
            for(int i = 0; i < ans.size(); i ++) {
                if(i != 0) printf(" ");
                printf("%d", ans[i]);
            }
        }
        return 0;
    }
    

      这个居然是个 01 背包 没看出来 哭唧唧

  • 相关阅读:
    锐捷交换机密码恢复
    adobe cs3系列产品官方帮助网页(中文)
    网页设计视频教程
    锐捷交换机、路由器配置手册
    WINPE下如何直接删除联想隐藏分区?
    IWMS实现频道页面的方法
    SATA、SCSI、SAS区别与特点
    自定义系统必备
    自己写的Web服务器
    尝试MVP模式
  • 原文地址:https://www.cnblogs.com/zlrrrr/p/10361640.html
Copyright © 2011-2022 走看看