1094.cpp

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

/*  This Code is Submitted by wywcgs for Problem 1094 on 2005-12-19 at 15:15:24 */ 
#include <cstdio>
#include <algorithm>
using namespace std;

int main()
{
	int n[6];
	int i;
	
	while(true) {
		int s = 0, used = 0;
		for(i = 0; i < 6; i++) {
			scanf("%d", &n[i]);
			s += n[i];
		}
		if(s == 0) return 0;
		used += n[5];
		used += n[4];
		n[0] = max(0, n[0]-n[4]*11);
		used += n[3];
		n[1] = max(0, (i = n[1]-n[3]*5));
		if(n[1] == 0) n[0] = max(0, n[0]+4*i);
		used += (n[2]+3) / 4; n[2] %= 4;
		if(n[2] == 1) n[1] = max(0, n[1]-5), n[0] = max(0, n[0]-7);
		else if(n[2] == 2) n[1] = max(0, n[1]-3), n[0] = max(0, n[0]-6);
		else if(n[2] == 3) n[1] = max(0, n[1]-1), n[0] = max(0, n[0]-5);
		used += (n[1]+8) / 9; n[1] %= 9;
		if(n[1] != 0) n[0] = max(0, n[0]-(36-4*n[1]));
		used += (n[0]+35) / 36;;
		printf("%d\n", used);
	}
	
	return 0;
}