UVA 11805 - Bafana Bafana UVA • Sep 1, 2020 Problem PDFSolution:#include int main() { int n,k,p,a,s,i; while(scanf("%d",&a)==1) { for(i=1;i<=a;i++) { scanf("%d%d%d",&n,&k,&p); s=k+p; while(s>n) { s=s-n; } printf("Case %d: %d\n",i,s); } } return 0; } https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/11805/11805.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