TopCoder

User's AC Ratio

NaN% (0/0)

Submission's AC Ratio

NaN% (0/0)

Tags

Description

Mr. T has a collection of n squares with side 1. How many different size of rectangles can he generate by putting these pieces together? Note that those squares should be put together nicely, may not overlap to each other.


Two rectangles are considered different if none of them can be rotated or moved to obtain the other one.


T先生有一些邊長為1的小正方形。請問他可以用這些小正方形組合成多少種不同的矩形? 注意: 小正方形不能重疊,必須整齊地排列。而兩個矩形之中,其中一個無法經由旋轉或平移變成另外一個的時候,我們說兩個矩形不同。

Input Format

The first line contains an integer T (1<=T<=300,000). For next T lines, each line there is an integer n (1<=n<=10,000,000) denotes the number of squares Mr. T has.

Output Format

For each case, output the number of different rectangles that Mr. T can obtain.

Sample Input 1

1
6

Sample Output 1

8

Hints

Problem Source

Migrated from old NTUJ.

DarkTmt

Subtasks

No. Testdata Range Score

Testdata and Limits

No. Time Limit (ms) Memory Limit (VSS, KiB) Output Limit (KiB) Subtasks
0 2000 262144 8192