Bitset hdoj 2051
2014-08-04 21:17
381 查看
/*
Bitset
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 12378 Accepted Submission(s): 9527
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
*/
/*从数学上看,左移1位等于乘以2,右移1位等于除以2,然后再取整,移位溢出的丢弃。*/
#include<cstdio>
#include<string.h>
#include<stdlib.h>
#define Max 1000000
char a[Max];
int main()
{
int n;
while(~scanf("%d",&n))
{
int i=0;
while(n)
{
if(n&1)
a[i++]='1';
else
a[i++]='0';
n>>=1;
}
while(i--)
{
printf("%c",a[i]);
}
printf("\n");
}
return 0;
}
Bitset
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 12378 Accepted Submission(s): 9527
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
*/
/*从数学上看,左移1位等于乘以2,右移1位等于除以2,然后再取整,移位溢出的丢弃。*/
#include<cstdio>
#include<string.h>
#include<stdlib.h>
#define Max 1000000
char a[Max];
int main()
{
int n;
while(~scanf("%d",&n))
{
int i=0;
while(n)
{
if(n&1)
a[i++]='1';
else
a[i++]='0';
n>>=1;
}
while(i--)
{
printf("%c",a[i]);
}
printf("\n");
}
return 0;
}
相关文章推荐
- HDOJ 2051 Bitset
- hdoj.2051 Bitset 20140729
- HDOJ 2051 Bitset
- Hdoj 2051 Bitset
- Hdoj 2051 Bitset
- HDOJ-- 2051 Bitset
- hdoj 2051 Bitset(数的进制转换问题)
- hdoj 2051 Bitset (进制转换)
- Bitset hdoj 2051
- hdoj 2051 Bitset【10进制转2进制】
- hdoj-2051-Bitset
- hdoj-2051-Bitset
- hdoj 2051 Bitset
- HDOJ2051_Bitset
- HDOJ 2051 Bitset
- HUD 2051 Bitset (水)
- HDU 2051 - Bitset
- hdu 2051 Bitset 把一个十进制转化为2进制数
- 杭电-2051 Bitset
- HDU 2051 Bitset