2051 Bitset

Bitset

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

Total Submission(s): 12764 Accepted Submission(s): 9823


[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

[align=left]Author[/align]
8600 && xhd    //此处改为 8000&&xhd 比较合适

#include<cstdio>
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
int s=0x8000,a[16],i=0;
while(s)a[i++]=n&s?'1':'0',s>>=1;
i=0;
while(a[i]=='0')i++;
for(;i<16;i++)putchar(a[i]);
putchar('\n');
}
return 0;
}