华为校招2016.09机试 第3题: 装满篮子

#include <cstdio>
using namespace std;

typedef long long int64;
int64 fit(int x, int64* w){
    int64 s = 0;
    int k = 0;
    while (x){
        if (x & 1) s += w[k];
        k++;
        x >>= 1;
    }
    return s;
}
void put(int x, int64* w){
    int k = 0;
    while (x){
        if (x & 1) printf(" %lld", w[k]);
        k++;
        x >>= 1;
    }
    puts("");
}
int main(){
    int64 w[100];
    int n = 0;
    int64 W;
    scanf("%lld", &W);
    while (scanf("%lld", &w[n++]) != EOF);
    int N = 1 << n;
    int find = 0;
    for (int k = 0; k < N; k++){
        if (W == fit(k, w)) {
            find = 1;
            printf("YES");
            put(k, w);
            break;
        }
    }
    if (!find) puts("NO");

    return 0;
}