Bitset

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> 
 
int main(){
    int number;
    char result[20];
    int length;
    int i;
    
    while((scanf("%d",&number))!=EOF){
        i=0;
        while(number){
            result[i]=number%2+'0';
            i++;
            number/=2;
        }
        length=i;
        
        for(i=length-1;i>=0;i--)
            printf("%c",result[i]);
            
        printf("
");
    }
        
    return 0;
}