Bitset HDU 2051



Bitset

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

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

 

二进制转化问题，我直接从之前博客的一个程序里复制到函数----这就是写博客的好处

#include <iostream>

using namespace std;

char nBinaryNumber[11];
int change(int n)
{
    int mod,len = 0;
    while(n !=0)
    {
        mod = n % 2;
        n =n /2;
        nBinaryNumber[len++] = mod + '0';
    }
    return len;
}

int main()
{
    int n,len,i;
    while(cin >> n)
    {
        len = change(n);
        for(i =len - 1;i >=0;i--)
        cout << nBinaryNumber[i] ;
        cout << endl;
    }
}