Bitset hd 2051

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 i,n,m,j,a[100];    while(scanf("%d",&n)!=EOF)    {        i=0;        while(n)        {            i=i+1;            a[i]=n%2;            n/=2;        }        for(i;i>0;i--)            printf("%d",a[i]);        printf("\n");    }    return 0;}