UVA 11650 - Mirror Clock UVA • Sep 1, 2020 Problem PDFSolution:#include int main() { int t,a,b; scanf("%d", &t); while(t--) { scanf("%d:%d", &a, &b); a=11-a+(b==0); if(a<=0) a=a+12; if(a!=0) b=60-b; if(b==60) b=0; printf("%02d:%02d\n",a,b); } return 0; } https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/11650/11650.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