基于含while循环与main的模板，C语言十进制转任意进制代码排查及打印语句编写

Hey there! Let's break down your two questions about decimal-to-any-base conversion in C— I’ve helped debug tons of these, so I know the common pitfalls and how to nail the printing logic.

Since you didn’t share your exact code, here are the most frequent issues that cause errors in these programs:

• Unvalidated base range: Most people forget to restrict the target base to 2–36 (beyond 36, there’s no standard character representation for digits). If you pass a base like 1 or 37, your code will either crash or output garbage.
• Incorrect remainder-to-character mapping: When a remainder is 10 or higher, you need to convert it to A–F (or lowercase). A common mistake is printing the raw remainder (e.g., outputting "10" instead of "A")—fix this with something like remainder + 'A' - 10 (or use a pre-defined character array for easier lookup).
• Reversed output order: Decimal conversion produces remainders in reverse order of the final result. For example, converting 10 to binary gives remainders 0,1,0,1—if you print these in the order you collect them, you’ll get 0101 instead of the correct 1010. You need to store remainders in an array and print them backwards, or use a stack.
• Ignoring negative numbers: Negative decimals need a special case: mark the number as negative, convert its absolute value, then prepend a - to the final output. Skipping this will give wrong results for negative inputs.
• No input validation: If the user enters non-numeric values (like letters or symbols), scanf will fail silently, leading to garbage calculations. Always check the return value of scanf to ensure valid input was read.

Assuming you’ve already got the core math logic (collecting remainders via a while loop), here’s how to build the printing step clearly:

First, let’s set the context: your template likely involves collecting remainders in an array as you divide the decimal number by the target base. The printing part needs to reverse those remainders and convert them to the correct characters.

Step-by-Step Printing Logic #

1. Create a digit lookup table: This simplifies converting remainders to characters. Define a string with all valid digits:

   char digits[] = "0123456789ABCDEF";
   

   Now any remainder n maps directly to digits[n].

2. Handle negative numbers: Before processing, check if the input is negative, mark it, and convert to a positive value (we’ll add the - back later):

   int is_negative = 0;
   if (num < 0) {
       is_negative = 1;
       // Fix for INT_MIN overflow (convert to unsigned int)
       unsigned int u_num = (unsigned int)-num;
       num = u_num;
   }
   

3. Collect remainders (your existing math loop):

   int remainders[32]; // Enough for 32-bit integers
   int count = 0;
   while (num > 0) {
       remainders[count++] = num % base;
       num = num / base;
   }
   

4. Print the result (reverse the remainders):

   • Special case: If the input was 0, count will be 0—directly print 0.
   • Otherwise, print the negative sign (if needed), then loop backwards through the remainders array to print the correct order:

   if (count == 0) {
       printf("Result: 0\n");
   } else {
       printf("Result: ");
       if (is_negative) {
           printf("-");
       }
       // Print remainders in reverse order
       for (int i = count - 1; i >= 0; i--) {
           printf("%c", digits[remainders[i]]);
       }
       printf("\n");
   }
   

Full Template Example #

Here’s how it all fits together in a complete program:

#include <stdio.h>

int main() {
    int num, base;
    char digits[] = "0123456789ABCDEF";
    int remainders[32];
    int count = 0;
    int is_negative = 0;

    printf("Enter a decimal number and target base (2-36): ");
    if (scanf("%d %d", &num, &base) != 2) {
        printf("Invalid input—please enter two integers.\n");
        return 1;
    }

    if (base < 2 || base > 36) {
        printf("Base must be between 2 and 36.\n");
        return 1;
    }

    // Handle negative numbers
    if (num < 0) {
        is_negative = 1;
        unsigned int u_num = (unsigned int)-num;
        num = u_num;
    }

    // Collect remainders
    while (num > 0) {
        remainders[count++] = num % base;
        num = num / base;
    }

    // Print final result
    if (count == 0) {
        printf("Result: 0\n");
    } else {
        printf("Result: ");
        if (is_negative) {
            printf("-");
        }
        for (int i = count - 1; i >= 0; i--) {
            printf("%c", digits[remainders[i]]);
        }
        printf("\n");
    }

    return 0;
}

内容的提问来源于stack exchange，提问作者N. Perr