Codeforces Round 756 (Div. 3) |
---|
Finished |
The All-Berland Team Programming Contest will take place very soon. This year, teams of four are allowed to participate.
There are $$$a$$$ programmers and $$$b$$$ mathematicians at Berland State University. How many maximum teams can be made if:
Thus, each team must have at least one programmer and at least one mathematician.
Print the required maximum number of teams. Each person can be a member of no more than one team.
The first line contains an integer $$$t$$$ ($$$1 \le t \le 10^4$$$) —the number of test cases.
This is followed by descriptions of $$$t$$$ sets, one per line. Each set is given by two integers $$$a$$$ and $$$b$$$ ($$$0 \le a,b \le 10^9$$$).
Print $$$t$$$ lines. Each line must contain the answer to the corresponding set of input data — the required maximum number of teams.
6 5 5 10 1 2 3 0 0 17 2 1000000000 1000000000
2 1 1 0 2 500000000
In the first test case of the example, two teams can be composed. One way to compose two teams is to compose two teams of $$$2$$$ programmers and $$$2$$$ mathematicians.
In the second test case of the example, only one team can be composed: $$$3$$$ programmers and $$$1$$$ mathematician in the team.
Name |
---|