代码实现: #include<stdio.h> #include<math.h> void cmp(int m, double n) { if (m > n) printf("Gai"); else if (m == n) printf("Ping"); else printf("Cong"); } int main() { int M, X, Y, i; double jia, yi, bing; scanf("%d %d %d", &M, &X, &Y); for (i = 99; i >= 10; i--) { int a = i / 10, b = i % 10; jia = 10 * a + b, yi = 10 * b + a, bing = fabs(jia - yi) / X; if (bing*Y == yi) break; } if (i == 9) printf("No Solution"); else { printf("%.0f ", jia); cmp(M, jia); printf(" "); cmp(M, yi); printf(" "); cmp(M, bing); } return 0; }