binary search constructive algorithms math *800

Please click on ads to support us..

Python Code:

row = input()
def smaller(a,b):
    if a>b:
        return b
    else:
        return a
for i in range(int(row)):
    row_col = input().split(' ')
    coder = int(row_col[0])
    mather = int(row_col[1])
    max = smaller((coder+mather)//4,smaller(coder,mather))
    print(max)



Comments

Submit
0 Comments
More Questions

1395B - Boboniu Plays Chess
1475D - Cleaning the Phone
617B - Chocolate
1051B - Relatively Prime Pairs
95B - Lucky Numbers
1692D - The Clock
1553D - Backspace
1670D - Very Suspicious
1141B - Maximal Continuous Rest
1341A - Nastya and Rice
1133A - Middle of the Contest
385A - Bear and Raspberry
1311B - WeirdSort
1713F - Lost Array
236B - Easy Number Challenge
275A - Lights Out
147A - Punctuation
253A - Boys and Girls
1327E - Count The Blocks
984A - Game
12B - Correct Solution
1355B - Young Explorers
485A - Factory
628A - Tennis Tournament
1436B - Prime Square
1707B - Difference Array
1422C - Bargain
1611F - ATM and Students
660A - Co-prime Array
1692F - 3SUM