實機體驗,再天天抽M8金豪禮★拿現金最實在!這畫面也太叫人垂涎欲滴!破戒!比丘吃葷 連3次...
2012-09-02 12:08:24 人氣(83) | 回應(0) | 推薦(0) | 收藏(0) 上一篇 | 下一篇

[UVA] 10365 - Blocks

0
收藏
0
推薦

Problem D: 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.

Sample Input

5
9
10
26
27
100

Output for Sample Input

30
34
82
54
130



#include <stdio.h>
#include <math.h>
int main() {
int t, n, i, j, k;
scanf("%d", &t);
while(t--) {
scanf("%d", &n);
int sq = (int)sqrt(n), sq2;
int ans = 0xfffffff;
for(i = 1; i <= sq; i++) {
if(n%i == 0) {
j = n/i;
sq2 = (int)sqrt(j);
for(k = 1; k <= sq2; k++) {
if(j%k == 0) {
int tmp = 2*(i*k + j + i*j/k);
if(tmp < ans)
ans = tmp;
}
}
}
}
printf("%d\n", ans);
}
return 0;
}
 

10365Blocks
台長:Morris
人氣(83) | 回應(0)| 推薦 (0)| 收藏 (0)| 轉寄
全站分類: 不分類 | 個人分類: UVA |
此分類下一篇:[UVA] 1237 - Expert Enough?
此分類上一篇:[ACM-ICPC][Asia - Daejeon] 5848 - Soju

我要回應
是 (若未登入"個人新聞台帳號"則看不到回覆唷!)
* 請輸入識別碼:
請輸入以下數字 (ex:123)

(有*為必填)
詳全文