（简单搜索）Blocks (P2363)

这个题就是一个很简单的搜索，我只是想把速度提高了一些，所以我一开始的做法是把给的一个数进行因数分解。

把分解出的有多少个质数进行组合搜索，不过也不知道哪里不对，一直没有AC。然后我就用很直白，很暴力的搜索。

毫无压力地，还是0MS过的。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
using namespace std;




int n;

int get(int a,int b,int c)
{
	return 2*(a*b+b*c+c*a);
}

int main()
{
	int i,j,k;
	int t;
	cin>>t;
	while (t--)
	{
		int ans=100000000;
		cin>>n;
		for (i=1;i<=n;i++)
		{
			for (j=i;j*i<=n;j++)
			{
				for (k=j;k*i*j<=n;k++)
				{
					/*
					if (i*j*k==n&&ans>get(i,j,k))
					{
						cout<<i<<' '<<j<<' '<<k<<' '<<get(i,j,k)<<endl;
					}
					*/
					if (i*j*k==n)
					ans=min(ans,get(i,j,k));
				}
			}
		}
		cout<<ans<<endl;
	}
	
	return 0;
}

Blocks

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 6506		Accepted: 3120

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

Source