HDU 1390 || ZOJ 1383 Binary Numbers
2012-09-06 22:15
423 查看
#include<stdio.h> void binary(int n) { int p=0; while(n){ if(n%2==1 && n/2!=0) printf("%d ",p); else if(n/2==0){ printf("%d\n",p--); break; } n/=2; p++; } } int main() { int d,i,n; while(scanf("%d",&d)!=EOF) { for(i=0;i<d;i++) { scanf("%d",&n); binary(n); } } return 0; }
相关文章推荐
- HDU1390_Binary Numbers【水题】【位运算】
- HDU 1390 Binary Numbers
- zoj 1383 Binary Numbers
- HDU1390 ZOJ1383 Binary Numbers【水题+输入输出】
- 杭电Hdu 1390 Binary Numbers
- zoj 1383 Binary Numbers
- ZOJ 1383 Binary Numbers
- ZOJ 1383 Binary Numbers
- 【HDU】1390 Binary Numbers
- HDU 1390 Binary Numbers
- ZOJ Problem Set - 1383 Binary Numbers
- ZOJ Problem Set - 1383 Binary Numbers
- ZOJ Problem Set–1383 Binary Numbers
- hdu 1390 Binary Numbers
- hdu 1390 Binary Numbers
- Binary Numbers 1390 HDU
- ZOJ 1383 Binary Numbers
- zoj 1383 Binary Numbers
- HDU 1390 Binary Numbers(数学题)
- hdu1390-Binary Numbers