zoukankan      html  css  js  c++  java
  • 1068 Find More Coins (30)

    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^4^ 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^4^, the total number of coins) and M(<=10^2^, 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~1~ <= V~2~ <= ... <= V~k~ such that V~1~ + V~2~ + ... + 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
    #include<cstdio>
    #include<algorithm>
    using namespace std;
    const int maxn = 10010;
    
    int w[maxn],dp[110] = {0};
    bool flag[maxn] = {0},choice[maxn][110];
    bool cmp(int a,int b){
        return a > b;
    }
    int main(){
        int n,m;
        scanf("%d%d",&n,&m);
        for(int i = 1; i <= n; i++){
            scanf("%d",&w[i]);
        }
        sort(w+1,w+n+1,cmp);
        for(int i = 1; i <= n; i++){
            for(int v = m; v >= w[i]; v--){
                if(dp[v] <= dp[v - w[i]] + w[i]){
                    dp[v] = dp[v - w[i]] + w[i];
                    choice[i][v] = 1;
                }else{
                    choice[i][v] = 0;
                }            
            }
        }
        if(dp[m] != m) printf("No Solution
    ");
        else{
            int k = n, num = 0, v = m;
            while(k >= 0){
                if(choice[k][v] == 1){
                    flag[k] = true;
                    num++;
                    v -= w[k];
                }
                else flag[k] = false;
                k--;
            }
            for(int i = n; i >= 1; i--){
               if(flag[i] == true){
                   printf("%d",w[i]);
                   num--;
                   if(num > 0) printf(" ");
               }
            }
        }
        return 0;
    }
  • 相关阅读:
    vue 爬坑之路---设置背景图,不能resolve编译
    vue 爬坑之路----flexible.js不适配ipad和ipad pro
    vue-cli3 vue.config.js配置
    vue组件
    Vue 路由按需keep-alive
    vue-cli项目搭建
    http和https
    js时间戳和日期互转换
    vue补充
    js实现头像上传(移动端,PC端均可)
  • 原文地址:https://www.cnblogs.com/wanghao-boke/p/9383368.html
Copyright © 2011-2022 走看看