动态规划1015

代码:
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; int main() {     int n;     int b[11];     while (cin >> n)     {         if (n == 0)         {             cout << "0" << endl;             continue;         }         int k = 0;         while(n)         {             b[k++] = n % 2;             n /= 2;         }         for (int i = k - 1; i >= 0; i--)             cout << b[i];         cout << endl;     }     return 0; }

你可能感兴趣的:(动态规划1015)