SRM 567 DIV2 250
(問題文は省略)
1 #include <stdio.h> 2 3 int NinjaTurtles_countOpponents(int P, int K) 4 { 5 int N; 6 int total; 7 8 for(N=P; (total=3*(N/K)+(N/3))<P; N++){ 9 } 10 if(total != P){ 11 return -1; 12 } 13 14 return N; 15 } 16 17 int main(void) 18 { 19 int P = 13; 20 int K = 17; 21 22 printf("Returns: %d\n", NinjaTurtles_countOpponents(P, K)); 23 24 return 0; 25 }