UVA 12578 - 10:6:2 UVA • Sep 1, 2020 Problem PDFSolution:#include #include #include #define Pi 2*acos(0.0) int main() { int t; double b,c,r,h,g,n; scanf("%d",&t); while(t--) { r=0; scanf("%lf",&n); r=n/5; h=(n*6)/10; r=Pi*r*r; g=(n*h)-r; printf("%.2lf %.2lf\n",r,g); } return 0; } https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/12578/12578.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