Bitset(位组)

time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 15281    Accepted Submission(s): 11595


Problem Description
Give you a number on base ten,you should output it on base two.(0 < n < 1000)
 

Input
For each case there is a postive number n on base ten, end of file.
 

Output
For each case output a number on base two.
 

Sample Input
   
   
   
   
1 2 3
 

Sample Output
   
   
   
   
1 10 11
#include<stdio.h> void f(int n) { if(n/2) f(n/2); printf("%d",n%2); }  main() { int n; while(scanf("%d",&n)!=EOF) { f(n); printf("\n");} return 0; }

你可能感兴趣的:(Bitset(位组))