问题描述
给定n个十六进制正整数,输出它们对应的八进制数。
输入格式
输入的第一行为一个正整数n (1<=n<=10)。
接下来n行,每行一个由09、大写字母AF组成的字符串,表示要转换的十六进制正整数,每个十六进制数长度不超过100000。
输出格式
输出n行,每行为输入对应的八进制正整数。
【注意】
输入的十六进制数不会有前导0,比如012A。
输出的八进制数也不能有前导0。
样例输入
2
39
123ABC
样例输出
71
4435274
***【*提示】
先将十六进制数转换成某进制数,再由某进制数转换成八进制。
PS:用的网上找到的写法,直接列举
#include <stdio.h>
#include <string.h>
#define N1 100000 /*16进制*/
#define N2 400008 /*2进制*/
int main(void) {
int n = 0 ;
int i = 0 , j = 0 , k = 0 , len = 0;
int flag = 0 , sum = 0 ;
char arr[N1] , num[N2];
scanf("%d",&n);
for (i = 0 ; i < n ; i ++) {
memset(num,'\0',N2);
scanf("%s",&arr);
len = strlen(arr);
k = 0;
if (len%3 == 1) {
num[0] = num[1] = '0';
k += 2;
} else if (len%3 == 2) {
num[0] = '0';
k += 1;
}
for (j = 0 ; j < len ; j ++ , k += 4) {
switch(arr[j]) {
case '0' :
num[k]='0',num[k+1]='0',num[k+2]='0',num[k+3]='0';
break;
case '1' :
num[k]='0',num[k+1]='0',num[k+2]='0',num[k+3]='1';
break;
case '2' :
num[k]='0',num[k+1]='0',num[k+2]='1',num[k+3]='0';
break;
case '3' :
num[k]='0',num[k+1]='0',num[k+2]='1',num[k+3]='1';
break;
case '4' :
num[k]='0',num[k+1]='1',num[k+2]='0',num[k+3]='0';
break;
case '5' :
num[k]='0',num[k+1]='1',num[k+2]='0',num[k+3]='1';
break;
case '6' :
num[k]='0',num[k+1]='1',num[k+2]='1',num[k+3]='0';
break;
case '7' :
num[k]='0',num[k+1]='1',num[k+2]='1',num[k+3]='1';
break;
case '8' :
num[k]='1',num[k+1]='0',num[k+2]='0',num[k+3]='0';
break;
case '9' :
num[k]='1',num[k+1]='0',num[k+2]='0',num[k+3]='1';
break;
case 'A' :
num[k]='1',num[k+1]='0',num[k+2]='1',num[k+3]='0';
break;
case 'B' :
num[k]='1',num[k+1]='0',num[k+2]='1',num[k+3]='1';
break;
case 'C' :
num[k]='1',num[k+1]='1',num[k+2]='0',num[k+3]='0';
break;
case 'D' :
num[k]='1',num[k+1]='1',num[k+2]='0',num[k+3]='1';
break;
case 'E' :
num[k]='1',num[k+1]='1',num[k+2]='1',num[k+3]='0';
break;
case 'F' :
num[k]='1',num[k+1]='1',num[k+2]='1',num[k+3]='1';
break;
default:
break;
}
}
for (j = 0 , flag = 0; j < k ; j += 3) {
if (num[j+0] == '0' && num[j+1] == '0' && num[j+2] == '0')
sum = 0;
else if (num[j+0] == '0' && num[j+1] == '0' && num[j+2] == '1')
sum = 1;
else if (num[j+0] == '0' && num[j+1] == '1' && num[j+2] == '0')
sum = 2;
else if (num[j+0] == '0' && num[j+1] == '1' && num[j+2] == '1')
sum = 3;
else if (num[j+0] == '1' && num[j+1] == '0' && num[j+2] == '0')
sum = 4;
else if (num[j+0] == '1' && num[j+1] == '0' && num[j+2] == '1')
sum = 5;
else if (num[j+0] == '1' && num[j+1] == '1' && num[j+2] == '0')
sum = 6;
else if (num[j+0] == '1' && num[j+1] == '1' && num[j+2] == '1')
sum = 7;
if (sum) {
flag = 1;
}
if (flag) {
printf("%d",sum);
}
}
printf("\n");
}
return 0;
}