#arc094b. [arc094_b]Worst Case
[arc094_b]Worst Case
Problem Statement
participants, including Takahashi, competed in two programming contests. In each contest, all participants had distinct ranks from first through -th.
The score of a participant is the product of his/her ranks in the two contests.
Process the following queries:
- In the -th query, you are given two positive integers and . Assuming that Takahashi was ranked -th in the first contest and -th in the second contest, find the maximum possible number of participants whose scores are smaller than Takahashi's.
Constraints
- All values in input are integers.
Input
Input is given from Standard Input in the following format:
Output
For each query, print the maximum possible number of participants whose scores are smaller than Takahashi's.
Sample Input 1
Sample Output 1
Let us denote a participant who was ranked -th in the first contest and -th in the second contest as .
In the first query, is a possible candidate of a participant whose score is smaller than Takahashi's. There are never two or more participants whose scores are smaller than Takahashi's, so we should print .