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

hide comments
(Tjandra Satria Gunawan)(曾毅昆): 2014-04-17 09:57:35

Finally AC! need a lot of submission to guess the input data :P

Ranker: 2014-04-17 09:57:35

Easy!! Simple logic would go!! :)

AMANRAJ : 2014-04-17 09:57:35

easy !

Suraj D: 2014-04-17 09:57:35

Hint: Keep the constraints in mind!

Last edit: 2012-10-18 19:06:08
Pranay: 2014-04-17 09:57:35

Is there some wrong formatting in i/o ?

cegprakash: no

Last edit: 2012-10-18 19:16:02
anshuman ansu: 2014-04-17 09:57:35

does output requires spaces after every line?

cegprakash: no. It's optional for you

Last edit: 2012-10-18 22:51:03
Aditya Bahuguna: 2014-04-17 09:57:35

Go for it...thats easy...i was jst lucky to be the first solver.. ;)


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