HUD 2051 Bitset

Bitset

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

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>
int main()
{
	int n;
	int a[15],i;
	while(~scanf("%d",&n))
	{
		for(i=0;n;i++)
		{
			a[i]=n%2;
			n/=2;
		}
		for(i=i-1;i>=0;i--)
			printf("%d",a[i]);
		putchar('\n');
	}
	
	return 0;
}