首页 > 其他 > 详细

HDU 5224 Tom and paper(BestCoder Round #40)

时间:2015-07-07 09:28:42      阅读:187      评论:0      收藏:0      [点我收藏+]

题目链接:Tom and paper


题面:

Tom and paper

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


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.
T10,n109
 

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

Sample Input
3 2 7 12
 

Sample Output
6 16 14
 

Source
 

解题:

若周长固定,取半值附近的值,面积最大。反之,取平方根附近,周长最长。


代码:

#include <iostream>
#include <cmath>
using namespace std;

int main()
{
    int t,n,root;
    cin>>t;
    while(t--)
    {
      cin>>n;
      root=sqrt(1.0*n);
      for(int i=root;;i--)
      {
      	if(n%i==0)
      	{
	      cout<<2*(i+n/i)<<endl;  	
	      break;
        }
      }
    }
    return 0;
}
 


版权声明:本文为博主原创文章,未经博主允许不得转载。

HDU 5224 Tom and paper(BestCoder Round #40)

原文:http://blog.csdn.net/david_jett/article/details/46780405

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!