Rectangles in a Circle
Submissions: 1276   Accuracy:

30.94%

  Difficulty: Easy   Marks: 2

Given a circular sheet of radius R, find the total number of rectangles with integral length and width can be cut from the sheet, one at a time. 

Input:
The first line of the input contains an integer T, denoting the number of test cases. Then T test cases follow. Each test case consists of a single line contaninng an integer R denoting the radius of the circular sheet.


Output:
Corresponding to each test case, output in a new line, an integer denoting the number of ways.


Constraints:
1<=T<=100

1<=N<=100

Example:
Input:
1
2

Output:
8
Explanation:
One can cut 8 rectangles form a circular sheet of radius 2.
1x1 , 1x2 , 2x1 , 2x2 , 1x3, 3x1, 2x3 , 3x2.

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Raju Varshney
Author: AdityaChatterjee


If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.

to report an issue on this page.