动态规划1015

代码：
[align=left]Problem Description[/align]
Give you a number on base ten,you should output it on base two.(0 < n < 1000)
 

[align=left]Input[/align]
For each case there is a postive number n on base ten, end of file.
 

[align=left]Output[/align]
For each case output a number on base two.
 

[align=left]Sample Input[/align]

1
2
3

 

[align=left]Sample Output[/align]

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;
}