UVA 10812 - Beat the Spread! Shipu Ahamed - 01 Sep 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