1485.cpp

这是哈尔滨工业大学acmOJ的源代码

/*  This Code is Submitted by wywcgs for Problem 1485 on 2006-03-14 at 21:37:05 */ 
#include <cstdio>
#include <algorithm>
using namespace std;

const int STR_MAX = 1024;
const int N_MAX = 256;

int main()
{
	bool can[STR_MAX];
	int bag[N_MAX], a, c;
	int n, i, j, stack[STR_MAX];
	
	while(scanf("%d %d %d", &a, &c, &n) != EOF) {
		for(i = 0; i < n; i++) scanf("%d", &bag[i]);
		sort(bag, bag+n);
		int top = 0, sum = 0; stack[top++] = 0;
		for(i = 0; i < n; i++) {
			int x = top, temp[STR_MAX];
			sum += bag[i]; memset(can, false, sizeof(can));
			for(top = j = 0; j < x; j++) {
				int na = stack[j] + bag[i], nc = sum - stack[j];
				if(na <= a && !can[na]) { temp[top++] = na; can[na] = true; }
				if(nc <= c && !can[stack[j]]) { temp[top++] = stack[j]; can[stack[j]] = true; }
			}
			memcpy(stack, temp, sizeof(temp));
			if(top == 0) break;
		}
		if(i == n) printf("Yes\n");
		else if(i == n-1) printf("Need a helper\n");
		else printf("No\n");
	}
	
	return 0;
}