Easy Array Counting#12254
Given three integers n,a,b , count how many increasing arrays of length exist:
A_1=a
a \le A_i \le b
A_2-A_1=A_3-A_2=A_4-A_3=...=A_n-A_{n-1}
The first line contains a single integer (1 \le t \le 10^4) – the number of test cases.
The only line of each test case contains three integers n,a,b (1 \le n \le 10^9 ; 1 \le a \le b \le 10^9) – the length of array and the boundaries of array .
For each test case, output the count of such arrays.
Example 1
In the first test case, the only possible array is [7,7,7,7].
In the second test case, the possible arrays are:
[4,4,4]
[4,5,6]
[4,6,8]
[4,7,10]
In the third test case, the possible arrays are:
[3,3,3,3,3]
[3,4,5,6,7]
Subtask ( points): (a=b).
Subtask ( points): (\sum b-a \le 100)
Subtask ( points): (\sum b-a \le 10^5)
Subtask ( points): No additional constraints