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 (≤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].
一开始想用dfs做,结果不管怎么剪,最后一个测点总是超时,看了一下别人的做法,基本是用的动态规划,但是我不太会,直到看到这篇,原来是最后一个测点中,所有币值加起来都不够,这样只需要在输入时将所有币值加和,并与m比较,若小于m直接输出无解。
当然DP还是要努力掌握的。。。
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int n, m, cnt = 0, sum = 0;
vector<int>coins, temp;
void ans(int start, int sum) {
if (sum == m) {
cnt++;
for (int i = 0; i < temp.size(); i++) {
cout << temp[i];
if (i != temp.size() - 1)cout << " ";
else
cout << endl;
}
return;
}
if (sum > m || start == n || cnt > 0)return;
temp.push_back(coins[start]);
ans(start + 1, sum + coins[start]);
temp.pop_back();
ans(start + 1, sum);
}
int main() {
cin >> n >> m;
coins.resize(n);
for (int i = 0; i < n; i++) {
cin >> coins[i];
sum += coins[i];
}
if (sum < m) {
cout << "No Solution" << endl;
return 0;
}
sort(coins.begin(), coins.end());
ans(0, 0);
if (cnt == 0)cout << "No Solution" << endl;
return 0;
}