Codeforcs Parallelepiped

#include<bits/stdc++.h>

using namespace std;

#define fast ios_base::sync_with_stdio(0)
#define bfast cin.tie(0)
#define outs(x) cout << x << " "
#define outn(x) cout << x << "\n"
#define sf scanf
#define pf printf
#define nl puts("")
#define psb push_back
#define mset(c,v) memset(c , v , sizeof c)
#define loop0(n) for(int i=0; i<n; i++)
#define loop1(n) for(int i=1; i<=n; i++)
#define mpair(x , y) make_pair(x , y)
#define all(x) x.begin(), x.end()
#define pi acos(-1.0)
#define psb push_back

typedef unsigned long long ull;
typedef long long LL;
typedef vector<int>vii;
typedef vector<LL>vll;
typedef vector<string>vs;
typedef map<int, int>mpii;
typedef map<string, int>mpsi;
typedef map<char, int>mpci;
typedef map<LL, LL>mpll;

const int mod = 1000007;
const int high = 102;

// sum of all 12 edges: formula is = 4 * (a + b + c)
// as the given areas so, formula will be = 4 * (sqrt(a * b / c) + sqrt(b * c / a) + sqrt(c * a / b))

int main()
{
    fast;
    int a , b , c;
    while(~sf("%d %d %d", &a , &b , &c))
    {
        double tmp = (sqrt(a * b / c) + sqrt(b * c / a) + sqrt(c * a / b));

        double ans = 4.0 * tmp;

        pf("%.0f\n" , ans);
    }

    return 0;
}