hdu 5224

hdu 5224 题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5224


Tom and paper


Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 952    Accepted Submission(s): 584




Problem Description
There is a piece of paper in front of Tom, its length and width are integer. Tom knows the area of this paper, he wants to know the minimum perimeter of this paper.
 


Input
In the first line, there is an integer T indicates the number of test cases. In the next T lines, there is only one integer n in every line, indicates the area of paper.
T≤10,n≤109
 


Output
For each case, output a integer, indicates the answer.
 


Sample Input
3
2
7
12
 


Sample Output
6
16
14
 


Source
BestCoder Round #40
 
题目大意是给你一个面积，喊你求最小的周长（长宽都是整数）。
暴力可过。

代码：

<span style="font-size:18px;">#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>using namespace std;int ans[100000009];int main(){    int T;    scanf("%d", &T);    while(T--)    {        int area;        scanf("%d", &area);        int cnt = 0;        for(int i=1; i*i<=area; i++)        {            if(area % i == 0)            {                ans[cnt++] = i*2 + (area/i)*2;            }        }        sort(ans, ans+cnt);        printf("%d\n", ans[0], ans[cnt-1]);    }    return 0;}</span>