Bitset

Bitset

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 13416 Accepted Submission(s): 10254

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>
#include <stdlib.h> 

int p[1000];
int main()
{
  int n,i,j;
  while(scanf("%d", &n) != EOF)
  {
    for(i=0; n>0; i++)
    {
      p[i] = n%2;
      n /= 2;
    }
    for(j=i-1;j>=0;j--)
      printf("%d",p[j]);
    printf("\n");
  }
  system("pause");
  return 0;
}