POJ44:正整数的任意进制转换

 1 #include "stdlib.h"
 2 #include <iostream>
 3 #include<cstring>
 4 #include <stdio.h>
 5 using namespace std;
 6 int main()
 7 {
 8     int n;
 9     cin >> n;
10     for (int i = 0; i < n; i++)
11     {
12         char num[800];//设置一个数组储存q进制数
13         int p, q;
14         cin >> p;
15         cin.ignore();
16         cin.getline(num, 800, ‘,‘);
17         cin >> q;
18         char res[800]; int count = 0;
19         while (1)
20         {
21             int x = 0; //归零
22             int len = 0;
23             for (int i = 0; i < strlen(num);)//对当前数字进行除q法
24             {
25                 while (x < q&&i<strlen(num))//x小于q的时候，直接将它作为余数*p给下一个位数  当i达到最后时直接将其作为余数存进另一个数组
26                 {
27                     if (num[i] >= ‘A‘&&num[i] <= ‘Z‘)
28                         x = x*p + num[i] + 10 - ‘A‘;
29                     else x = x*p +num[i]- ‘0‘;
30                     num[i] = ‘0‘;
31                     i++;
32                 }
33                 if (x >= q)//x比q大的时候，进行除法
34                 {
35                     if (x / q > 9) num[i - 1] = x / q + ‘A‘ - 10;
36                     else num[i - 1] = x / q + ‘0‘;
37                     x %= q;
38                 }
39             }
40             if (x > 9)//余数进行转换以后存入数组res
41                 res[count++] = x - 10 + ‘A‘;
42             else
43                 res[count++] = x + ‘0‘;
44             len = -1;
45             for(int i=0;i<strlen(num)&&num[i]==‘0‘;i++)
46             {
47                 len = i;
48             }
49             if (strlen(num) - len < 2)
50                 break;
51         }
52         for (int i = count - 1; i >= 0; i--)
53             cout << res[i];
54         cout << endl;
55     }
56 }