HDU 5224 Tom and paper
2015-05-09 22:24
309 查看
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
Sample Output
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 直接暴力判断#include<cstdio> #include<cmath> #include<queue> #include<map> #include<string> #include<cstring> #include<iostream> #include<algorithm> using namespace std; int T, n; int main() { scanf("%d", &T); while (T--) { scanf("%d", &n); int k = sqrt(1.0*n), ans = 0x7FFFFFFF; for (int i = 1; i <= k; i++) if (n%i == 0) ans = min(ans, 2 * (i + n / i)); printf("%d\n", ans); } return 0; }
相关文章推荐
- HDU 5224 Tom and paper(BestCoder Round #40)
- HDU 5224 Tom and paper(最小周长)
- HDU_5224 Tom and paper
- hdu 5224 Tom and paper
- hdu 5224 Tom and paper 水题
- HDU 5224 Tom and paper
- HDU 5224 Tom and paper
- HDU_5224 Tom and paper
- hdu 5224 Tom and paper
- hdu 5224 Tom and Paper
- hdu 5524 Tom and paper
- HDU5224 Tom and paper(BestCoder Round #40)
- 组合数(Lucas定理) + 快速幂 --- HDU 5226 Tom and matrix
- hdu 5226 Tom and matrix
- Tom and paper
- hdu 5226 Tom and matrix (推公式,lucas)
- HDU - 5225 Tom and permutation
- bestcode round #40 1001 Tom and paper
- 组合数(Lucas定理) + 快速幂 --- HDU 5226 Tom and matrix
- hdu 5225 Tom and permutation(回溯)