2051 Bitset

Bitset

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

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<iostream>
using namespace std;
void main()
{
	int n,i;
	while(cin>>n)
	{
		i=0;
		int a[20];
		while(n!=0)
		{
			a[i]=n%2;
			n/=2;
			i++;
		}
		for(i--;i>=0;i--)
			cout<<a[i];
		cout<<endl;
	}
}