Codeforces Round #138 (Div. 2) A. Parallelepiped
来源:互联网 发布:淘宝上的牙套有用吗 编辑:程序博客网 时间:2024/06/07 05:38
点击打开链接
A. Parallelepiped
time limit per test
2 secondsmemory limit per test
256 megabytesinput
standard inputoutput
standard outputYou've got a rectangular parallelepiped with integer edge lengths. You know the areas of its three faces that have a common vertex. Your task is to find the sum of lengths of all 12 edges of this parallelepiped.
Input
The first and the single line contains three space-separated integers — the areas of the parallelepiped's faces. The area's values are positive ( > 0) and do not exceed 104. It is guaranteed that there exists at least one parallelepiped that satisfies the problem statement.
Output
Print a single number — the sum of all edges of the parallelepiped.
Sample test(s)
input
1 1 1
output
12
input
4 6 6
output
28
Note
In the first sample the parallelepiped has sizes 1 × 1 × 1, in the second one — 2 × 2 × 3.
题意:给你一个长方体有一个公共点的三个平面的面积,求其各边长度烦人和。
代码:
#include<iostream>#include<algorithm>#include<cstring>#include<cstdio>using namespace std;int main(){ int m,n,t,i,j,k; while(~scanf("%d%d%d",&m,&n,&t)) { for(i=1;i<=m;i++) { if(m%i!=0) continue; if(m/i*n/i==t) break; } printf("%d\n",(i+m/i+n/i)*4); }return 0;}
0 0
- Codeforces Round #138 (Div. 2) A. Parallelepiped
- Codeforces Round #138 (Div. 2)--Parallelepiped(水题)
- Codeforces Round #138 (Div. 2) A题
- Codeforces Round #131 (Div. 2) A B
- Codeforces Round #174 (Div. 2) Problem A
- Codeforces Round #173 (Div. 2) A.Bit++
- Codeforces Round #181 (Div. 2) A题
- Codeforces Round #184 (Div. 2) A题
- Codeforces Round #185 (Div. 2)--A,B
- Codeforces Round #172 (Div. 2) A题
- Codeforces Round #166 (Div. 2) A题
- Codeforces Round #132 (Div. 2) A题
- Codeforces Round #131 (Div. 2) A题
- Codeforces Round #133 (Div. 2) A题
- Codeforces Round #137 (Div. 2) A题
- Codeforces Round #147 (Div. 2) A题
- Codeforces Round #141 (Div. 2) A题
- Codeforces Round #143 (Div. 2) A题
- 论坛口碑营销建议
- 黑马程序员:c语言--指针
- 分享5款实用网络管理工具
- 设计模式六大原则
- Openfire开发配置,Openfire源代码配置,OpenFire二次开发配置
- Codeforces Round #138 (Div. 2) A. Parallelepiped
- 动态调整UITableViewCell高度的实现方法
- Redis学习手册(主从复制)
- 关于socket阻塞与非阻塞情况下的recv、send、read、write返回值
- Android 之 下拉框(Spinner)的使用
- 第三周作业——冒泡排序和归并排序
- 嵌入式Linux下Camera编程--V4L2 (V4L2内核驱动配置、USB转串配置)
- HashMap的工作原理
- 黑马程序员:C语言--条件判断