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 ( &gt; 0) and do not exceed 10<sup class="upper-index">4</sup>. It is guaranteed that there exists at least one parallelepiped that satisfies the problem statement.
#include <iostream>
#include<bits/stdc++.h>
using namespace std;

int main() {
    int x,y,z;
    cin>>x>>y>>z;
    int a,b,c;
    a=(x*z)/y; b=(x*y)/z; c=(y*z)/x;
    cout<<4*a+ 4*b + 4*c<<endl;
	return 0;
}