DIEHARD - DIE HARD
The game is simple. You initially have ‘H’ amount of health and ‘A’ amount of armor. At any instant you can live in any of the three places - fire, water and air. After every unit time, you have to change your place of living. For example if you are currently living at fire, you can either step into water or air.
If you step into air, your health increases by 3 and your armor increases by 2
If you step into water, your health decreases by 5 and your armor decreases by 10
If you step into fire, your health decreases by 20 and your armor increases by 5
If your health or armor becomes <=0, you will die instantly
Find the maximum time you can survive.
The first line consists of an integer t, the number of test cases. For each test case there will be two positive integers representing the initial health H and initial armor A.
For each test case find the maximum time you can survive.
Note: You can choose any of the 3 places during your first move.
1 <= t <= 10
1 <= H, A <= 1000
3 2 10 4 4 20 8
1 1 5
thanks hitman tests code really helped
its a nice problem seems difficult while just seeing this problem. but the numerical provided make it easy!! you can check my code [spoiler removed]Last edit: 2015-08-10 21:01:20
it's a very nice problem....and an easy one also :D
Last edit: 2015-04-10 02:15:07
Nice..[spoiler removed] approach...ACLast edit: 2015-08-10 21:02:42
Last edit: 2015-04-03 01:18:30
It is a good problem , but no [spoiler removed] is required. easy if you get the idea behind it, nice work problem setter :)Last edit: 2015-03-28 16:34:43
[Spoiler removed] :PLast edit: 2015-02-26 12:40:38
working with all test cases i can think of.. still wrong answer. i tried hitman's test cases my code is working fine with those cases. :(
@Rishab Joshi check the size of your array if you use [spoiler removed]Last edit: 2015-03-28 16:35:06