admin 管理员组文章数量: 1086019
2024年12月22日发(作者：ising模型python)
for(k = j - 1; k >= 0; k--)
{
printf("%d", p[k]);
}
printf("n");
}
}
void two_sixten(int a)
{
int i, j, k, s = 0;
char p[30];
int result = 0;
for(i = 1; a != 0; i *= 2)
{
if(a % 10 > 1)
{
s = 1;
break;
}
else
{
result += (a % 10) * i;
a = a / 10;
}
}
for(j = 0; result != 0; j++)
{
p[j] = result % 16;
result = result / 16;
if (p[j] > 10)
{
switch(p[j])
{
case 10:
void eight_two(int a)
{
int i, j, k, s = 0;
int result = 0;
int p[30];
for(i = 1; a != 0; i *= 8)
{
if(a % 10 > 7)
{
s = 1;
break;
}
else
{
result += (a % 10) * i;
a = a / 10;
}
}
for(j = 0; result != 0; j++)
{
p[j] = result % 2;
result = result / 2;
}
if(s == 1)
printf("It is wrongn");
else
{
printf("n转换后的数为：");
for(k = j - 1; k >= 0; k--)
{
printf("%d", p[k]);
}
printf("n");
}
}
void eight_ten(int a)
{
int i, s = 0;
int result = 0;
for(i = 1; a != 0; i *= 8)
{
if(a % 10 > 7)
{
s = 1;
break;
}
else
{
result += (a % 10) * i;
a = a / 10;
}
}
if(s == 1)
printf("It is wrongn");
else
{
printf("n转换后的数为：%dn", result);
}
}
void eight_sixten(int a)
{
int i, j, k, s = 0;
char p[30];
int result = 0;
for(i = 1; a != 0; i *= 8)
{
if(a % 10 > 7)
{
s = 1;
break;
}
else
{
result += (a % 10) * i;
a = a / 10;
}
}
for(j = 0; result != 0; j++)
{
p[j] = result % 16;
result = result / 16;
if(p[j]
p[j] += 48;
else
{
switch(p[j])
{
case 10:
p[j] = 'A';
break;
case 11:
p[j] = 'B';
break;
case 12:
p[j] = 'C';
break;
case 13:
p[j] = 'D';
break;
case 14:
p[j] = 'E';
break;
case 'A':
b[i] = 10;
break;
case 'B':
b[i] = 11;
break;
case 'C':
b[i] = 12;
break;
case 'D':
b[i] = 13;
break;
case 'E':
b[i] = 14;
break;
case 'F':
b[i] = 15;
break;
case 'a':
b[i] = 10;
break;
case 'b':
b[i] = 11;
break;
case 'c':
b[i] = 12;
break;
case 'd':
b[i] = 13;
break;
case 'e':
b[i] = 14;
break;
case 'f':
b[i] = 15;
break;
default:
s = 1;
}
}
}
for(i = 1, j = k - 1; j >= 0; j--, i *= 16)
{
result += b[j] * i;
}
if(s == 1)
printf("It is wrongn");
else
{
printf("n转换后的数为：%d", result);
}
}
void sixten_two(char a[], int k)
{
int i, j, s = 0;
int result = 0;
int b[50];
int p[30];
for(i = 0; i
{
if(a[i] <= '9' && a[i] >= '1')
b[i] = a[i] - 48;
else
{
switch(a[i])
{
case 'A':
b[i] = 10;
break;
case 'B':
b[i] = 11;
break;
case 'C':
b[i] = 12;
break;
case 'D':
b[i] = 13;
break;
case 'E':
b[i] = 14;
break;
case 'F':
b[i] = 15;
break;
case 'a':
b[i] = 10;
break;
case 'b':
b[i] = 11;
break;
case 'c':
b[i] = 12;
break;
case 'd':
b[i] = 13;
break;
case 'e':
b[i] = 14;
break;
case 'f':
b[i] = 15;
break;
default:
s = 1;
}
}
}
for(j = k - 1, i = 1; j >= 0; j--, i *= 16)
{
result += b[j] * i;
}
for(j = 0; result != 0; j++)
{
p[j] = result % 2;
result = result / 2;
}
if(s == 1)
printf("It is wrongn");
else
{
printf("n转换后的数为：");
for(k = j - 1; k >= 0; k--)
{
printf("%d", p[k]);
}
printf("n");
}
}
void sixten_eight(char a[], int k)
{
int i, j, s = 0;
int result = 0;
int b[30];
int p[30];
for(i = 0; i
{
if(a[i] <= '9' && a[i] >= '1')
b[i] = a[i] - 48;
else
{
switch(a[i])
{
case 'A':
b[i] = 10;
break;
case 'B':
b[i] = 11;
break;
case 'C':
b[i] = 12;
break;
case 'D':
b[i] = 13;
break;
case 'E':
b[i] = 14;
break;
case 'F':
b[i] = 15;
break;
case 'a':
b[i] = 10;
break;
case 'b':
b[i] = 11;
break;
case 'c':
b[i] = 12;
break;
case 'd':
b[i] = 13;
break;
case 'e':
b[i] = 14;
break;
case 'f':
b[i] = 15;
break;
default:
s = 1;
}
}
}
for(j = k - 1, i = 1; j >= 0; j--, i *= 16)
{
result += b[j] * i;
}
for(j = 0; result != 0; j++)
{
p[j] = result % 8;
result = result / 8;
}
if(s == 1)
printf("It is wrongn");
else
{
printf("n转换后的数为：");
for(k = j - 1; k >= 0; k--)
{
printf("%d", p[k]);
}
printf("n");
}
}
{
int j, k;
int p[30];
for(j = 0; a != 0; j++)
{
p[j] = a % 16;
a = a / 16;
if(p[j]
p[j] += 48;
else
{
switch(p[j])
{
case 10:
p[j] = 'A';
break;
case 11:
p[j] = 'B';
break;
case 12:
p[j] = 'C';
break;
case 13:
p[j] = 'D';
break;
case 14:
p[j] = 'E';
break;
case 15:
p[j] = 'F';
break;
}
}
}
printf("n转换后的数为：");
for(k = j - 1; k >= 0; k--)
{
printf("%c", p[k]);
}
printf("n");
}
版权声明：本文标题：转换进制程序C语言,C语言各进制转换源代码 内容由网友自发贡献，该文观点仅代表作者本人， 转载请联系作者并注明出处：http://www.roclinux.cn/p/1734955925a1614281.html， 本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌抄袭侵权/违法违规的内容，一经查实，本站将立刻删除。
发表评论