hdoj.2051 Bitset 20140729

Bitset

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 12392 Accepted Submission(s): 9539



[align=left]Problem Description[/align]
Give you a number on base ten,you should output it on base two.(0 < n < 1000)

[align=left]Input[/align]
For each case there is a postive number n on base ten, end of file.

[align=left]Output[/align]
For each case output a number on base two.

[align=left]Sample Input[/align]

1
2
3

[align=left]Sample Output[/align]

1
10
11 [code]#include<stdio.h>
int zh(int a){
int i=0,x=a;
char p[15];
while(x){
p[i++]=x%2+'0';
x/=2;
}
i--;
for(;i>=0;i--) printf("%c",p[i]);
printf("\n");
}
int main()
{
int a;
while(scanf("%d",&a)!=EOF){
zh(a);
}
return 0;
}

[/code]