poj2363Blocks

/*题意是有m个边长为1的方块，求把他包起来的最小面积。暴力通过了，稍微优化一下。长宽高乘积就是小方块数量
第一个for差了一个等号。。开始感觉如果没有等号也可以因为i = 1和j=m;i= m, j = 1一样，，后来发现不行，如果是1的话直接WA了。。考虑全面，细心*/

#include<iostream>
using namespace std;

int main()
{
    int n, m;
    cin >> n;
    while (n--)
    {
        cin >> m; int k; double min = 0xffffffffffff;
        for (int i = 1; i <= m; ++i)
        {
            if (m%i != 0)
                continue;
            for (int j = 1; j <= m/i; ++j)
            {
                int temp = i*j;
                if (m%temp == 0)
                {
                    k = m / temp;
                    int sum = 2*(i*j + j*k + i*k);
                    if (min > sum)
                        min = sum;
                }
            }
        }
        cout << min << endl;
    }
    return 0;
}

/*Description
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?

Input
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.

Output
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.

Sample Input

5
9
10
26
27
100

Sample Output

30
34
82
54
130
*/