【Codeforcese】 487A

考虑各种情况。。。

#include <iostream>
#include <queue> 
#include <stack> 
#include <map> 
#include <set> 
#include <bitset> 
#include <cstdio> 
#include <algorithm> 
#include <cstring> 
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 1005
#define maxm 1000005
#define eps 1e-10
#define mod 1000000007
#define INF 0x3f3f3f3f
#define PI (acos(-1.0))
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid 
#define rson o<<1 | 1, mid+1, R
//#pragma comment(linker, "/STACK:16777216")
typedef long long LL;
typedef unsigned long long ULL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
void scanf(int &__x){__x=0;char __ch=getchar();while(__ch==' '||__ch=='\n')__ch=getchar();while(__ch>='0'&&__ch<='9')__x=__x*10+__ch-'0',__ch = getchar();}
LL gcd(LL _a, LL _b){if(!_b) return _a;else return gcd(_b, _a%_b);}
// head

int h1, a1, d1;
int h2, a2, d2;
int h3, a3, d3;

void read(void)
{
	scanf("%d%d%d", &h1, &a1, &d1);
	scanf("%d%d%d", &h2, &a2, &d2);
	scanf("%d%d%d", &h3, &a1, &d3);
}

bool check(int t1, int t2, int t3)
{
	t1 += h1;
	t2 += a1;
	t3 += d1;
	if(a2 - t3 <= 0 && t2 > d2) return true;
	if(a2 - t3 > 0 && t2 <= d2) return false;
	if(a2 - t3 == 0) {
		if(t2 > d2) return true;
		else return false;
	}
	int t = (t1 - 1) / (a2 - t3);
	if((t2 - d2) * t >= h2) return true;
	else return false;
}

void work(void)
{
	int ans = INF;
	for(int i = 0; i <= 100; i++)
		for(int j = 0; j <= 100; j++)
			for(int k = 0; k <= 100; k++)
				if(check(i, j, k))
					ans = min(ans, i * h3 + j * a3 + k * d3);

	printf("%d\n", ans);
}

int main(void)
{
	read();
	work();

	return 0;
}