UVA 11805 - Bafana Bafana Shipu Ahamed - 01 Sep 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