You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
|
|
|
|
|
#include<bits/stdc++.h>
|
|
|
|
|
|
|
|
|
|
|
|
using namespace std;
|
|
|
|
|
|
/*
|
|
|
|
|
|
֪ʶ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݣ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ֺ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|
|
|
|
|
|
|
|
|
|
|
<EFBFBD>ĵ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݲο<EFBFBD><EFBFBD><EFBFBD>
|
|
|
|
|
|
https://www.cnblogs.com/aiguona/p/9218754.html
|
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
int n, k, a[22], b[22];
|
|
|
|
|
|
|
|
|
|
|
|
bool dfs(int x, int sum) //<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ұ<EFBFBD><D2B1><EFBFBD>һ<EFBFBD><D2BB><EFBFBD>ɵý<C9B5>
|
|
|
|
|
|
{
|
|
|
|
|
|
if (sum > k)
|
|
|
|
|
|
return false;
|
|
|
|
|
|
if (x == n)
|
|
|
|
|
|
return sum == k; //<2F><><EFBFBD><EFBFBD>ǰn<C7B0><6E><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ˣ<EFBFBD><CBA3><EFBFBD><EFBFBD><EFBFBD>sum=k<>Ƿ<EFBFBD><C7B7><EFBFBD><EFBFBD><EFBFBD>
|
|
|
|
|
|
if (dfs(x + 1, sum)) {
|
|
|
|
|
|
b[x] = 0; //<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>a[x]<5D><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ϊ0<CEAA><30>
|
|
|
|
|
|
return true;
|
|
|
|
|
|
}
|
|
|
|
|
|
if (dfs(x + 1, sum + a[x])) {
|
|
|
|
|
|
b[x] = 1; //<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>a[x]<5D><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ϊ1<CEAA><31>
|
|
|
|
|
|
return true;
|
|
|
|
|
|
}
|
|
|
|
|
|
return false;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int main() {
|
|
|
|
|
|
while (scanf("%d%d", &n, &k) != EOF) {
|
|
|
|
|
|
for (int i = 0; i < n; i++)
|
|
|
|
|
|
scanf("%d", &a[i]);
|
|
|
|
|
|
if (dfs(0, 0)) {
|
|
|
|
|
|
printf("YES\n");
|
|
|
|
|
|
for (int i = 0; i < n; i++)
|
|
|
|
|
|
if (b[i])
|
|
|
|
|
|
printf("%d ", a[i]);
|
|
|
|
|
|
printf("\n");
|
|
|
|
|
|
} else
|
|
|
|
|
|
printf("NO\n");
|
|
|
|
|
|
}
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
}
|
