Codeforces Round #278 (Div. 2) C. Fight the Monster(暴力)

C. Fight the Monster

A monster is attacking the Cyberland!

Master Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).

During the battle, every second the monster's HP decrease by max(0, ATK_Y - DEF_M), while Yang's HP decreases by max(0, ATK_M - DEF_Y), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.

Master Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.

Now Master Yang wants to know the minimum number of bitcoins he can spend in order to win.

Input

The first line contains three integers HP_Y, ATK_Y, DEF_Y, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.

The second line contains three integers HP_M, ATK_M, DEF_M, separated by a space, denoting the HP, ATK and DEF of the monster.

The third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.

All numbers in input are integer and lie between 1 and 100 inclusively.

Output

The only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.

Sample test(s)

Input

1 2 1
1 100 1
1 100 100

Output

99

Input

100 100 100
1 1 1
1 1 1

Output

0

Note

For the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.

For the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.

题意：玩一个游戏，问你保持血量大于零的情况下把怪物杀死，最少需要花多少钱（因为钱可以买属性，果然是屌丝玩家啊……），第一行给你三个数值hy,ay,dy,分别代表你的生命值，攻击力，防御力，第二行给你三个数值hm,am,dm,分别代表怪物的生命值，攻击力，防御力，第三行给你三个数值h,a,d,分别代表生命值，攻击力，防御力的单价。并且（给你的所有数值都在0——100之间，包括0,100）。计算方式，每次自己和怪物同时受到攻击，自己将减少（怪物攻击力-自己防御力)点血量，怪物将减少（自己攻击力-怪物防御力）点血量。

思路：用两个循环枚举购买的攻击力和防御力，以确定自己攻击力防御力，可求出最少需要血量。然后判断此时花费的钱是不是更少。

    for(int j=0;j<=max(0,100-ay+dm);j++)//攻击
    for(int k=0;k<=max(0,am-dy);k++)//防御

由此知：自己有效攻击力=j+ay-dm；怪物有效攻击力=am-dy-k;怪物血量=hm;

已知自己攻击和对方血量，可以求出最少攻击次数n，n=hm/(j+ay-dm)；if(hm%(j+ay-hm)!=0) n++;//因为整数除法去尾，所以判断是否需要再打一下才能打死。

所以自己需要最少血量为：n*(am-dy-k)+1-hy；//当为负数时应看做零。

       范围确定方法一：因为怪物防御力最多100，血量最多100，自己攻击最低0，所以最多买200攻击必定可以秒杀对方（买再多无意义）。

                                    因为怪物攻击力最多是100，自己防御力最少是0，所以最多买100攻击就可以不受伤害（买再多无意义）。

       范围确定方法二：原理相同，自己攻击力-怪物防御力>100就会无意义；所以列出方程：ay+j-dm<=100，即j<=100-ay+dm；因为j>=0，所以j<=max(0,100-ay+dm)；

                                    自己防御力-怪物攻击力>0就会无意义；所以列出方程：dy+k-am<=0，即k<=am-dy;因为k>=0，所以k<=max(0,am-dy)；

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
using namespace std;
#define INF 100000007

int main(){
    int hy,ay,dy,hm,am,dm,h,a,d;
    int mi=INF;
    cin>>hy>>ay>>dy>>hm>>am>>dm>>h>>a>>d;
    for(int j=0;j<=max(0,100-ay+dm);j++)//攻击
    for(int k=0;k<=max(0,am-dy);k++){//防御
        int n;
        if(j+ay-dm>0){
            n=hm/(j+ay-dm);
            if(hm%(j+ay-dm)!=0)
                n++;
            int i=max(0,n*(am-dy-k)+1-hy);
            mi=min(mi,i*h+j*a+k*d);
        }
    }
    cout<<mi<<endl;
    return 0;
}