2221.cpp

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

/*  This Code is Submitted by wywcgs for Problem 2221 on 2006-05-14 at 18:48:53 */ 
#include <cstdio>
#include <algorithm>
using namespace std;

int main()
{
	int fund, year, n, i, j;

	while(scanf("%d %d %d", &fund, &year, &n) != EOF) {
		int cpd, chg, best = 0; double rate;
		for(i = 0; i < n; i++) {
			scanf("%d %lf %d", &cpd, &rate, &chg);
			int base = fund, ex = 0;
			for(j = 0; j < year; j++) 
				if(cpd) base = base*(1+rate)-chg;
				else { ex += base*rate; base -= chg; }
			best = max(best, base+ex);
		}
		printf("%d\n", best);
	}
	
	return 0;
}