题号：NC210599
时间限制：C/C++/Rust/Pascal 5秒，其他语言10秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
时间限制：C/C++/Rust/Pascal 5秒，其他语言10秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
题目描述
For a given a, n, find the number of integer pairs (x,y) such that %3D1%2C%20y%7C(x%5E2%2Ba)%2C%20x%7C(y%5E2%2Ba)%2C%201%5Cleq%20x%5Cleq%20y%5Cleq%20n)
.
输入描述:
The first line contains one integer T— the number of test cases.
For each test cases, the first line contains two integers.
输出描述:
For each test cases, output one number - the number of solutions.