HDU 2051 Bitset

Bitset

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

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
  
  

 

Author

8600 && xhd

 

Source

校庆杯Warm Up

 

Recommend

linle   |   We have carefully selected several similar problems for you:   2156  2105  2065  1219  2399 

 

Statistic |  Submit |  Discuss |  Note

#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
    int n;
    while(cin>>n)
    {
     int a[100],i=0;
     while(n)
     {
        a[i]=n%2;
        i++;
        n=n/2;
     }
     for(int k=i-1;k>=0;k--)
     {
        printf("%d",a[k]);
     }
     printf("\n");
    }
    return 0;
}