ZOJ Problem Set - 1383 Binary Numbers
2013-10-13 19:06
351 查看
水题,输出的时候注意下
#include <stdio.h> #include <math.h> int main() { int d; scanf("%d",&d); while(d--) { int binary[30]; int n,i=0; scanf("%d",&n); while(n!=0) { binary[i++]=n%2; n/=2; } int flag=1; for(int j=0;j<i;j++) { if(binary[j]) { printf("%d",j); if(j!=i-1) printf(" "); } } printf("\n"); } return 0; }
相关文章推荐
- ZOJ Problem Set–1383 Binary Numbers
- ZOJ Problem Set - 1383 Binary Numbers
- ZOJ Problem Set - 1383 Binary Numbers
- ZOJ Problem Set - 1858 Soundex
- ZOJ Problem Set - 1078
- ZOJ Problem Set - 1049 I Think I Need a Houseboat
- ZOJ Problem Set - 1002
- ZOJ Problem Set - 1205 Martian Addition
- ZOJ Problem Set - 1091 Knight Moves
- ZOJ Problem Set - 3623Battle Ships
- ZOJ Problem Set - 1056
- ZOJ Problem Set - 2850 Beautiful Meadow
- ZOJ Problem Set - 2922 Bombs
- ZOJ Problem Set - 1010
- ZOJ Problem Set - 1014
- ZOJ Problem Set - 1940 Dungeon Master
- ZOJ Problem Set - 1544 Currency Exchange
- ZOJ Problem Set - 1048
- ZOJ Problem Set 1002: Fire Net
- ZOJ Problem Set - 1007 Numerical Summation of a Series