hdu 1390
2012-07-11 17:56
225 查看
地址:http://acm.hdu.edu.cn/showproblem.php?pid=1390
题意:求n转换成2进制后1的位置。
mark:
代码:
题意:求n转换成2进制后1的位置。
mark:
代码:
#include <stdio.h> int main() { int d,n,i,f; scanf("%d", &d); while(d-- && scanf("%d", &n)) { i = f = 0; while(n) { if(n & 1) { if(f) printf(" "); printf("%d", i); f = 1; } n = (n >> 1); i++; } printf("\n"); } return 0; }
相关文章推荐
- HDU 1390 Binary Numbers
- HDU 1390 Binary Numbers
- HDU1390_Binary Numbers【水题】【位运算】
- 【HDU】1390 Binary Numbers
- hdu1390-Binary Numbers
- HDU1390 ZOJ1383 Binary Numbers【水题+输入输出】
- hdu 1390 Binary Numbers
- hdu 1390
- [恢]hdu 1390
- HDU 1390 || ZOJ 1383 Binary Numbers
- hdu 1390
- hdu 1390 Binary Numbers
- hdu 1390
- hdu 1390
- HDU Binary Numbers 1390(转换+统计)
- HDU 1390 Binary Numbers(数学题)
- Binary Numbers 1390 HDU
- 杭电Hdu 1390 Binary Numbers
- hdu 1390 Binary Numbers
- HDU 1390 Binary Numbers