Hamster and Equation

题号：NC221649
时间限制：C/C++/Rust/Pascal 2秒，其他语言4秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld

题目描述

To proof himself is no longer a pupil, Hamster is going to solve a math problem from his brother in junior high school.

His brother is learning the quadradic equation recently, and his teacher give him a problem like this:

Find all the solution of the following equation: $x_1(x_1+1) +x_2(x_2+1)=k(\;x_3(x_3+1)+x_4(x_4+1)\;)$

where $x_i$ are all integers in range $[-n,n]$ and $k$ is a given consistant.

Hamster doesn't know how to solve this equation due to his poor math skills, so now he turns to your help.

Can you tell him the number of valid solutions for this equation?

Note: Two Solutions are considered different if there exists an integer $i$ such that $x_i$ is different for two solutions.

The test files contain one or more test cases, the first line contains a integer $T$ , representing the number of test cases in this file.

For the following $T$ lines, each line contains two integers $n,k$ , the constant of this equations. Here $1\le n,|k| \le 500$ .

It is guaranteed that $\sum n \le 2000$ for all the test cases.

For each test case, output one integer  in a single line, representing the number of solutions for each given .

示例1

复制

复制

33
20
16