【简单】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

分析：
暴力枚举，求最小表面积，测试数据对时间要求不高。
代码：

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int T;
    cin>>T;
    while(T--)
    {
        int n;
        int mini=1000000;
        cin>>n;
        for (int i=1;i<=n;i++)
        {
            for (int j=1;i*j<=n;j++)
            {
                if (n%(i*j)==0)
                {
                    int k=(n/i)/j;
                    int S=(i*j+i*k+j*k)*2;
                    if (S<mini)
                    {
                        mini=S;
                    }
                }
            }
        }
        cout<<mini<<endl;
    }
    return 0;
}