Bitset
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 28560 Accepted Submission(s): 21028
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取余再除以2,直至被除数为零,用数组记录余数,再反向输出
源代码如下:
#include<iostream>
using namespace std;
int main()
{
int n;
while (cin >> n)
{
int a[20], i;
i = 0; //记录余数的个数
while (n!=0)
{
a[i++] = n % 2;
n /= 2;
}
for (int j = i - 1; j>=0; j --) //反向输出
cout << a[j];
cout << endl;
}
return 0;
}