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⁴ 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].

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<cstdio>#include<algorithm>using namespace std;const int maxn = 10010;const int maxv = 110;int w[maxn], dp[maxv] = { 0 };//w[i]為錢幣的價(jià)值bool choice[maxn][maxn], flag[maxn];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--)		{			//狀態(tài)轉(zhuǎn)移方程			if (dp[v] <= dp[v - w[i]] + w[i])//等于時(shí)也要放			{				dp[v] = dp[v - w[i]] + w[i];				choice[i][v] = 1;//放入第i件物品			}			else choice[i][v] = 0;//不放第i件物品		}	}	if (dp[m] != m) printf("No Solution");//無(wú)解	else	{		//記錄最優(yōu)路徑		int k = n, num = 0, v = m;		while (k >= 0)		{			if (choice[k][v] == 1)			{				flag[k] = true;				v -= w[k];				num++;			}			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;}