UVA 10812 - Beat the Spread! UVA • Sep 1, 2020 Problem PDFSolution:#include int main() { long int t,a,b,c,d,i; while(scanf("%ld",&t)==1) { i=0; while(ia||(a-b)%2!=0) printf("impossible\n"); else { c=(a-b)/2; d=c+b; printf("%ld %ld\n",d,c); } i++; } } return 0; } https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/10812/10812.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