UVA 10347 - Medians UVA • Sep 1, 2020 Problem PDFSolution:#include #include #include #include #include #include #include #include #include #include #include #include #define ll long long #define sc scanf #define pf printf #define Pi 2*acos(0.0) using namespace std; int main() { double a,b,c,n,s; while(sc("%lf %lf %lf",&a,&b,&c)==3) { s=(a+b+c)/2; n=(4.0/3.0)*(sqrt(s*(s-a)*(s-b)*(s-c))); if(n>0) pf("%.3lf\n",n); else pf("-1.000\n",n); } return 0; } https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/10347/10347.cpp Tags UVA Competitive Programming Shipu Ahamed Recommended for you UVA UVA 913 - Joana and the Odd Numbers 4 years ago • 1 min read UVA UVA 871 - Counting Cells in a Blob 4 years ago • 3 min read UVA UVA 866 - Intersecting Line Segments 4 years ago • 3 min read