PAT甲级练习1068. Find More Coins (30)
来源:互联网 发布:淘宝上不错的美国代购 编辑:程序博客网 时间:2024/06/07 14:12
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 104 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 (<=104, the total number of coins) and M(<=102, 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 k >= 1 such that A[i]=B[i] for all i < k, and A[k] < B[k].
Sample Input 1:8 95 9 8 7 2 3 4 1Sample Output 1:
1 3 5Sample Input 2:
4 87 2 4 3Sample Output 2:
No Solution
#include <iostream> #include <cstdio> #include <algorithm> #include <vector> #include <map> #include <set> #include <stack> #include <queue> #include <string> #include <string.h> using namespace std;const int MAX = 1e4+10;int n, m, w[MAX], dp[MAX];bool choice[MAX][101];bool cmp(int a, int b){ return a>b;}int main() {scanf("%d%d", &n, &m);for(int i=1; i<=n; i++){scanf("%d",&w[i]);}sort(w+1, w+1+n, cmp);for(int i=1; i<=n; i++){for(int j=m; j>=w[i]; j--){if(dp[j-w[i]]+w[i] >= dp[j]){choice[i][j] = true;dp[j] = dp[j-w[i]]+w[i];}}}vector<int> ans;if(dp[m] != m) printf("No Solution\n");else{int l=n, v=m;while(v>0){if(choice[l][v]==true){ans.push_back(w[l]);v -= w[l];}l--;}for(int i=0; i<ans.size(); i++) printf("%d%s", ans[i], i==ans.size()-1?"\n":" ");}scanf("%d",&n); return 0;}
- PAT甲级练习1068. Find More Coins (30)
- PAT甲级1068. Find More Coins (30)
- 【PAT甲级】1068. Find More Coins (30)
- PAT 甲级 1068. Find More Coins (30)
- 1068. Find More Coins (30)-PAT甲级真题(01背包)
- PAT甲级练习1048. Find Coins (25)
- PAT A 1068. Find More Coins (30)
- pat 1068. Find More Coins (30)
- PAT 1068. Find More Coins (30)
- 【PAT】1068. Find More Coins (30)
- pat 1068. Find More Coins (30)
- PAT(A) - 1068. Find More Coins (30)
- pat 1068. Find More Coins (30)
- PAT-A-1068. Find More Coins (30)
- PAT 1068. Find More Coins
- PAT 1068. Find More Coins
- 【PAT】1068. Find More Coins
- PAT--1068. Find More Coins
- Android面试题集
- 增量学习方法
- iOS:学习runtime的理解和心得
- 使用docker快速搭建MySQL主从集群
- 445. Add Two Numbers II
- PAT甲级练习1068. Find More Coins (30)
- 关于期权
- linux上 nohup command >/dev/null 2>&1 &的含义
- 移动端热修复方案-Tencent tinker
- RSync实现文件备份同步
- J2SE习题—基本语法2
- 加解密的一个方法
- SHA1算法
- 16进制颜色透明度计算方法