Description
输入一个非负整数(十进制),输出此整数对应的二进制数
Input
正整数(十进制)
Output
对应的二进制数
Sample Input
6
Sample Output
110
- #include <stdio.h>
void
jisuan(
int
num,
int
n);
void
jisuan(
int
num,
int
n)
- {
int
i=1,j;
char
a[999];
if
(num<0)
{
printf
(
"-"
);
num=-num;
}
i=1;
while
(num>0)
{
a[i]=num%n+
'0'
;
if
(a[i]>=
'0'
+10) a[i]=
'A'
+a[i]-
'0'
-10;
num=num/n;
i++;
}
for
(j=i-1;j>=1;j--)
printf
(
"%c"
,a[j]);
printf
(
"\n"
);
- }
int
main(
void
)
- {
int
num,n;
scanf
(
"%d"
,&num);
n=2;
if
(num==0)
printf
(
"0\n"
);
else
jisuan(num,n);
return
0;
- }