Sherlock and Watson have recently enrolled in a computer programming course.
Today, the tutor taught them about the balanced parentheses problem. A string
S consisting only of characters ( and/or ) is balanced if:
- It is the empty string, or:
- It has the form
(S), where S is a balanced string, or: - It has the form S1S2, where S1 is a balanced string and S2 is a balanced string.
Sherlock coded up the solution very quickly and started bragging about how good
he is, so Watson gave him a problem to test his knowledge. He asked Sherlock to
generate a string S of L + R characters, in which there are a total of
L left parentheses ( and a total of R right parentheses ).
Moreover, the string must have as many different balanced non-empty substrings
as possible. (Two substrings are considered different as long as they start or
end at different indexes of the string, even if their content happens to be the
same). Note that S itself does not have to be balanced.
Sherlock is sure that once he knows the maximum possible number of balanced non-empty substrings, he will be able to solve the problem. Can you help him find that maximum number?
The first line of the input gives the number of test cases, T. T test cases follow. Each test case consists of one line with two integers: L and R.
For each test case, output one line containing Case #x: y, where x is
the test case number (starting from 1) and y is the answer, as described
above.
1 ≤ T ≤ 100.
Input Output 3 Case #1: 0 1 0 Case #2: 1 1 1 Case #3: 3 3 2
(. There are no balanced non-empty
substrings.(). There is only one balanced non-empty
substring: the entire string itself.()()( and (()() give the same optimal answer.()()(, for example, the three balanced substrings are ()
from indexes 1 to 2, () from indexes 3 to 4, and ()() from indexes 1
to 4.