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-08-27 19:50:06 ANIKET
[spoiler removed]

Last edit: 2015-09-16 23:29:07
2015-08-27 11:36:18 Anurag Sharma
what is [spoilers removed] !!!
2015-08-23 07:10:27 Mohit Rathore
So funny to read the comments! :P
2015-07-22 17:08:03 shravinson
<snip>
is working fine with test cases
but showing WA on submission
can any1 tell me why so??

Last edit: 2023-05-15 22:06:18
2015-07-05 15:28:38 Shashank Tiwari
For those who are trying [spoilers removed]

Last edit: 2015-08-10 20:59:54
2015-06-29 02:06:12
How to solve it using [spoilers removed]? I used [spoilers removed] bcs the constraints are feasible. But I really want to learn [spoilers removed].

Last edit: 2015-08-10 21:00:43
2015-06-21 13:34:22 ankit kumar
thanks hitman tests code really helped
2015-06-13 03:49:40
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
2015-04-23 20:48:58
it's a very nice problem....and an easy one also :D
2015-04-04 07:39:38 GAURAV CHANDEL
Nice..[spoiler removed] approach...AC

Last edit: 2015-08-10 21:02:42
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.