Bitset (二进制转化）

Bitset

Time Limit : 1000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)

Total Submission(s) : 4 Accepted Submission(s) : 4

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>
#include<algorithm>
using namespace std;
int main(int ac,char *av[])
{
    int ten,two,tmp;
    while(cin>>ten)
    {
        if(ten==1)
        {
          cout<<1<<endl;
          continue;
        }
        two=0,tmp=1;
        while(ten>1)
        {
            two+=(ten%2)*tmp;
            tmp*=10;
            ten=ten/2;
            if(ten==1)
            two+=ten*tmp;
        }
        cout<<two<<endl;
    }
    return 0;
}