2158.cpp

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

/*  This Code is Submitted by wywcgs for Problem 2158 on 2005-12-12 at 09:49:56 */ 
#include <cstdio>

const int TOTAL = 100;
const int INF = 100000000;

inline int up(int, int);

int main()
{
	int np, nn, nz, r;
	int i;
	
	while(scanf("%d %d %d %d", &np, &nn, &nz, &r) != EOF && r != 0) {
		int time = INF;
		for(i = 0; i <= TOTAL; i++) {
			time <?= nz * up(TOTAL, r) + nn * (i+up(TOTAL-(r-1)*i, r)) + 
				np * (i+up(TOTAL-(r+2)*i, r));
		}
		printf("%d\n", time);
	}
	
	return 0;
}

inline int up(int a, int b)
{
	if(a < 0) {
		return 0;
	} else {
		return (a + b - 1) / b;
	}
}