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
2021-07-25 11:24:22
Did this with [spoiler] + [spoiler] . But this is can be done using simple [spoiler] .

Last edit: 2021-11-29 19:14:20
2021-07-06 08:23:12
done with [spoiler] approach
2021-07-01 15:52:27
spoiler
2021-06-30 08:29:38
solved using [spoiler] with o(1) space.

Last edit: 2021-11-29 19:14:44
2021-06-05 20:18:27
does [1001][1001][3] array exceeds the memory available? Gives SIGKILL for me :(
2021-06-01 09:38:23
Can easily be solved using [spoiler] approach.

Last edit: 2021-06-18 17:42:29
2021-05-30 16:19:52
hello
2021-05-27 15:40:05
what is the [spoiler] for this ?

Last edit: 2021-06-18 17:43:07
2021-05-23 22:07:16
Can be done using [spoiler]. AC in 1 GO

Last edit: 2021-06-18 17:43:26
2021-05-11 12:56:04
[spoiler][spoiler][spoiler]
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.