UVa 11805 - Bafana Bafana : Solution in C

Solution:

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17

#include<stdio.h> int main() { int T,N,K,i,P,D; scanf("%d",&T); for(i=1;i<=T;i++){ scanf("%d%d%d",&N,&K,&P); D = K+P; while(D>N) { D = D - N; } printf("Case %d: %d\n",i,D); } return 0; }