代码:
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 1011
代码:
#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; }
本文介绍了一个简单的C++程序,该程序能够将十进制数转换为二进制数。通过使用取余和除法操作,程序有效地实现了从十进制到二进制的转换,并通过样例输入输出展示了其正确性和实用性。
296

被折叠的 条评论
为什么被折叠?



