```c #include <stdio.h> void convert(int n, int k) { int stack[32], top = 0; while (n!= 0) { int remainder = n % k; if (remainder < 10) { stack[top++] = remainder + '0'; } else { stack[top++] = remainder - 10 + 'a'; } n /= k; } for (int i = top - 1; i >= 0; i--) { printf("%c", stack[i]); } printf("\n"); } int main() { int t, n, k; scanf("%d", &t); for (int i = 0; i < t; i++) { scanf("%d %d", &n, &k); printf("%d ", n); convert(n, k); } return 0; } ``` [2024-11-18 21:36:03 | AI写代码神器 | 229点数解答]