1015 of dop

Problem O

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

Total Submission(s) : 77   Accepted Submission(s) : 58

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
  
  

   简单的二进制转换。通过循环除以2取余数得到一个数组，反向输出即可。

   解题代码：

#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
   long long int flag,t,i;
   int a[1000];
   while(cin>>i)
   {
       flag=0;
       while(i!=0)
       {
           a[flag]=i%2;
           i/=2;
           flag++;
       }
       for(i=flag-1;i>=0;i--)
        cout<<a[i];cout<<endl;
   }
}