HDU 5224 Tom and paper
2015-07-31 19:15
363 查看
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
32
7
12
Sample Output
616
14
题意:给定矩形纸片的面积,求出最少的周长
//代码实现 #include<iostream> #include<cstdio> #include<cmath> using namespace std; int main() { int t; scanf("%d",&t); while(t--) { long long n; long long len,x; scanf("%lld",&n); for(int i=1;i<=sqrt(n);i++) //sqrt(n)可以缩小循环的范围 { if(n%i==0)//找出符合条件的长 { x=n/i; len=2*(i+x);//求出最小的周长 } } printf("%lld\n",len); } return 0; }
相关文章推荐
- 信息提示框
- poj-1265 Area
- 计原——脱机运算器实验
- git: reset
- 百度地图定位纠偏
- iOS 判断当前屏幕旋转状态
- 2015 HUAS Summer Contest#2~B
- hdu 1394 Minimum Inversion Number 【线段树求逆序数】
- OpenSSL命令行工具的证书操作
- HDU 5334 Virtual Participation
- 字符串各种数据类型
- [第1章]地图:iOS简易导航
- 项目中用到的Java注解
- LeetCode SubSets
- Android侧滑抽屉效果实现
- post 和get提交的乱码问题
- 前端性能之非阻塞加载js脚本
- opencv 其他形态学变换
- webrtc 支持h264 思路
- poj 1328 Radar Installation