DIEHARD - DIE HARD

Problem Statement:

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.

Input:

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.


Output:

For each test case find the maximum time you can survive.

 

Note: You can choose any of the 3 places during your first move.

 

Input Constraints:

1 <= t <= 10
1 <= H, A <= 1000

Example:

Sample Input:

3
2 10
4 4
20 8

Sample Output:

1
1
5

Added by:cegprakash
Date:2012-10-13
Time limit:10s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64

hide comments
2015-03-05 23:05:59 Abhinandan Agarwal
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
2015-02-02 10:51:50 Diptesh Patel
[Spoiler removed] :P

Last edit: 2015-02-26 12:40:38
2015-01-31 14:19:45 do_do
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. :(
edit : tried 3 hours later with same code and got accepted :p

Last edit: 2015-01-31 20:25:08
2015-01-15 07:13:15 kailash
@Rishab Joshi check the size of your array if you use [spoiler removed]

Last edit: 2015-03-28 16:35:06
2014-12-24 17:55:23 Rishabh Joshi
Working with even hitman's testcases, still WA. :/ any help?
2014-12-24 17:51:23 Anand
silly mistake , costed me 1wa . Thanks Hitman , testcase helped
2014-12-24 11:17:28 Mayank Ladia
[spoiler removed].... but test cases are weak... :p

Last edit: 2015-03-28 16:35:40
2014-05-12 15:45:12 jiglipufff
my frst typical [spoiler removed] prob!!!!

Last edit: 2015-03-28 16:35:53
2014-04-18 13:04:52 The Exorcist
easy [spoiler removed] !!

Last edit: 2015-03-28 16:36:04
2014-04-17 09:57:35 nitesh kumar
half century!!!

Last edit: 2014-02-08 07:38:34
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.