看了大佬的思路,改变了一点
#include <stdio.h>
#include <string.h>
#include <malloc.h>
struct Shiliu{
char s[1000001] ;
};
typedef struct Shiliu shiliu ;
int main()
{
int n ;
scanf("%d",&n) ;
shiliu* a = (shiliu*)malloc(n*sizeof(shiliu)) ;
char er[1000001], ba[1000001] ;
char d[16][5]={"0000","0001","0010","0011","0100",
"0101","0110","0111","1000","1001",
"1010","1011","1100","1101","1110","1111"} ;
for(int i=0;i<n;++i)
scanf("%s",a[i].s) ;
int number = 0 ;
for(int i=0;i<n;++i)
{
number=0 ;
for(int j=0;a[i].s[j]!='\0';++j)
{
if(a[i].s[j]>=65)
a[i].s[j] -= 7 ;
er[number++]=d[a[i].s[j]-48][0] ;
er[number++]=d[a[i].s[j]-48][1] ;
er[number++]=d[a[i].s[j]-48][2] ;
er[number++]=d[a[i].s[j]-48][3] ;
}
er[number]='\0' ;
number=0 ;
int j=0 ;
if((strlen(er))%3==2)
{
ba[number++]=(er[j++]-48)*2+(er[j++]-48)*1+48 ;
}
else if((strlen(er))%3==1)
{
ba[number++]=er[j++] ;
}
for(;er[j]!='\0';)
{
ba[number++]=(er[j++]-48)*4+(er[j++]-48)*2+(er[j++]-48)*1+48 ;
}
ba[number]='\0' ;
int sign=0 ;
while(1)
{
if(ba[sign++]!='0')
break ;
}
sign-- ;
while(ba[sign]!='\0')
printf("%c",ba[sign++]) ;
printf("\n") ;
er[0]='\0' ; ba[0]='\0' ;
}
return 0 ;
}
具体思路为
16转2,转2方式为1拆4,定义一个二维数组为16进制的0–F,然后在根据相应的位置找到对应的2进制。
然后2转8,为3合一。具体思路为按权展开后相加。