HDU 5224 Tom and paper（最小周长）
HDU 5224 Tom and paper（最小周长）
HDU 5224 Tom and paper（最小周长）
Time Limit: 1000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64u
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<= 10^9
Output
For each case, output a integer, indicates the answer.
Sample Input
3 2 7 12
Sample Output
6 16 14
题解：给出面积求最小周长问题，数学问题
AC代码
#include<cstdio> #include<cmath> int main() { int t,s,n; scanf("%d",&t); while(t--) { scanf("%d",&s); n=(int)sqrt((double) s); while(s%n) n--; n=2*(n+s/n); printf("%d/n",n); } return 0; }
正文到此结束
热门推荐
相关文章
近期评论
-
666
-
文章和留言都翻到11页了 没有OOM
-
-
朋友，翻页到11页，及以后，会出现OOM，无法访问
-
-
-
-
版本号是多少，你可以下载哪个代码仓库，jdk选1.8 直接跑就行
-
-
Loading...
![[HBLOG]公众号](https://www.liuhaihua.cn/img/qrcode_gzh.jpg)
