2363 Blocks

---

/*将正方体拼成表面积最小的长方体*/
/*利用体积不变，暴力枚举。*/
#include<iostream>
#include<algorithm>

using namespace std;

int main()
{
    int C;
    cin >> C;
    while (C--)
    {
        int N;
        int cnt = 0;
        cin >> N;
        int area[1000] = { 0 };
        for (int i = 1; i <= N; i++)
        {
            for (int j = 1; j <= N / i; j++)
            {
                for (int k = 1; k <= N / i / j; k++)
                {
                    if (i*j*k == N)
                    {
                        area[cnt++] = 2 * (i*j + i*k + j*k);
                    }
                }
            }
        }
        sort(area, area + cnt);
        cout << area[0] << endl;
    }

    return 0;
}