点击打开链接
Bitset
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 9132 Accepted Submission(s): 7037
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
Author
8600 && xhd
Source
Recommend
linle
这道题用栈比较好做。
#include<stdio.h>
#include<iostream>
#include<stack>
using namespace std;
int main()
{
int m;
stack<int> z;
while(scanf("%d",&m)!=EOF)
{
int x=m;
while(x>0)
{
z.push(x%2);
x/=2;
}
while(!z.empty())
{
cout<<z.top();
z.pop();
}
printf("\n");
}
return 0;
}