UVA 10678 - The Grazing Cow UVA • Sep 1, 2020 Problem PDFSolution:#include #include #include #include #include #include #include #include #define pi 2*acos(0.0) using namespace std; int main() { unsigned long long i; cin>>t; while(t--){ double x,y; cin>>x>>y; double t; t=sqrt((y/2)*(y/2)-(x/2)*(x/2)); printf("%.3lf\n",pi*y/2*t); } return 0; } https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/10678/10678.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