hdu 5224 Tom and Paper
2015-07-31 18:42
316 查看
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.
Output
For each case, output a integer, indicates the answer.
Sample Input
3
2
7
12
Sample Output
6
16
14
题意:
输入一张矩形纸的面积,求出其最小周长。
思路:
直接暴力求解,如果用两重循环,会超时,换成一重循环则不会。
代码:
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.
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<algorithm> using namespace std; int main() { int T; int n; double x; int y; scanf("%d",&T); while(T--) { int ans=2*1000000000; scanf("%d",&n); x=sqrt(n); for(int i=1;i<=x;i++) { if(n%i==0) { y=n/i; ans=min(ans,2*(i+y)); } } printf("%d\n",ans); } return 0 ; }
相关文章推荐
- argc, argv 你真的理解了吗?
- stm32处理器调试模式下运行正常,上电自启动后运行不正常的故障排查分析
- 苹果开发 笔记(55)NSURLConnection
- HDOJ1024(最大M子段和)
- web发布基础知识
- How Many Tables-并查集
- 编程过程分析(hdu 4515为例)
- Android studio 安装中遇到一些问题的解决办法,分享一下
- Libevent中英文文档地址
- delete和delete[]的区别
- nyoj 710 外星人的供给站【贪心区间选点】
- java中的sleep()和wait()的区别
- 《R语言实战》读书笔记--为什么要学
- java 多线程--线程池
- 根据手机屏幕动态设置控件的宽高
- HttpContext.Current.Cache 和 HttpRuntime.Cache 区别
- IOS时间格式转换
- dataTable 转换json串
- unity-Animation
- HDU 4311,4312 Meeting point(曼哈顿距离,切比雪夫距离)