2158Blocks

2158   Blocks

题目描述


Donald wishes to send a gift to his new nephew, Fooey. Donald is a bit of a traditionalist, so he has chosen to send a set of N classic baby blocks. Each block is a cube, 1 inch by 1 inch by 1 inch. Donald wants to stack the blocks together into a rectangular solid and wrap them all up in brown paper for shipping. How much brown paper does Donald need?

输入格式:

The first line of input contains C, the number of test cases. For each case there is an additional line containing N, the number of blocks to be shipped. N does not exceed 1000.

输出格式:

Your program should produce one line of output per case, giving the minimal area of paper (in square inches) needed to wrap the blocks when they are stacked together.
输入样例 复制
5
9
10
26
27
100
输出样例 复制
30
34
82
54
130

说明

49
98
通过提交
时空限制1000ms/128mb
题目来源
评测方式在线评测
题目类型枚举
难        度