You'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.
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.
Print a single number — the sum of all edges of the parallelepiped.
1 1 1
12
4 6 6
28
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;
}