New update is available. Click here to update.

Posted: 25 Feb, 2021

Difficulty: Moderate

```
Let’s assume that we have a chessboard of dimension 4x4, i.e. N = 4. Then the rectangles can have the following possible dimensions: {1*2, 1*3, 1*4, 2*1, ……, 2*4, ………,4*4}. So, the total number of rectangles in the chessboard is 70.
```

```
The very first line of input contains an integer T’ denoting the number of test cases.
The first line of every test case contains an integer ‘N’ denoting the dimension of the chessboard.
```

```
For each test case, print the number of possible rectangles, excluding squares, in a N x N chessboard.
Output for each test case is printed on a separate line.
```

```
The result can be very large. So, print the answer modulo 1000000007.
You do not need to print anything, it has already been taken care of. Just return the number of possible rectangles.
```

```
1 <= T <= 10
1 <= N <= 5 * 10^4
Time Limit: 1 sec
```

SIMILAR PROBLEMS

Unit Power Subsets

Posted: 11 Feb, 2022

Difficulty: Hard

Magical Digits

Posted: 13 Feb, 2022

Difficulty: Ninja

Magical Digits

Posted: 13 Feb, 2022

Difficulty: Ninja

Ninja And The LCM

Posted: 12 Apr, 2022

Difficulty: Easy

A Number Game

Posted: 23 Apr, 2022

Difficulty: Moderate

Pair Product Div by K

Posted: 15 May, 2022

Difficulty: Moderate

Pair Product Div by K

Posted: 15 May, 2022

Difficulty: Moderate

Categories:

Popular Courses: