hdoj.1390 Binary Numbers 20140821
来源:互联网 发布:三菱fx编程代码 编辑:程序博客网 时间:2024/05/16 03:19
Binary Numbers
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2779 Accepted Submission(s): 1717
Problem Description
Given a positive integer n, find the positions of all 1's in its binary representation. The position of the least significant bit is 0.
Example
The positions of 1's in the binary representation of 13 are 0, 2, 3.
Task
Write a program which for each data set:
reads a positive integer n,
computes the positions of 1's in the binary representation of n,
writes the result.
Example
The positions of 1's in the binary representation of 13 are 0, 2, 3.
Task
Write a program which for each data set:
reads a positive integer n,
computes the positions of 1's in the binary representation of n,
writes the result.
Input
The first line of the input contains exactly one positive integer d equal to the number of data sets, 1 <= d <= 10. The data sets follow.
Each data set consists of exactly one line containing exactly one integer n, 1 <= n <= 10^6.
Each data set consists of exactly one line containing exactly one integer n, 1 <= n <= 10^6.
Output
The output should consists of exactly d lines, one line for each data set.
Line i, 1 <= i <= d, should contain increasing sequence of integers separated by single spaces - the positions of 1's in the binary representation of the i-th input number.
Line i, 1 <= i <= d, should contain increasing sequence of integers separated by single spaces - the positions of 1's in the binary representation of the i-th input number.
Sample Input
113
Sample Output
0 2 3#include<stdio.h>#include<string.h>int main(){ int t,n,i,j,s[50]; scanf("%d",&t); while(t--){ scanf("%d",&n); int x=2; memset(s,0,sizeof(s)); for(i=1;;i++){ if(x*2>n) break; x*=2; } j=i; while(n>=0){ if(n-x>=0){ s[j]=1; n-=x; } //else x/=2; if(j==0) break; x/=2; j--; } x=0; for(j=0;j<=i;j++){ if(s[j]){ if(x==0){ printf("%d",j);x++; } else printf(" %d",j); } } printf("\n"); } return 0;}
0 0
- hdoj.1390 Binary Numbers 20140821
- HDOJ 1390 Binary Numbers(水题)
- HDOJ 1390 Binary Numbers(进制问题)
- hdu 1390 Binary Numbers
- HDU 1390 Binary Numbers
- hdu 1390 Binary Numbers
- hdu 1390 Binary Numbers
- Binary Numbers 1390 HDU
- HDU 1390 Binary Numbers
- hdu-oj 1390 Binary Numbers
- HDU 1390 Binary Numbers(数学题)
- Binary Numbers
- Binary Numbers
- Binary Numbers
- Binary Numbers
- HDU 1390 || ZOJ 1383 Binary Numbers
- 杭电Hdu 1390 Binary Numbers
- HDU 1390 Binary Numbers【进制转换】
- 理解矩阵(三)
- JSON 入门指南
- 操作符(++,+,+=,小于号,(),--等)重载
- Node.js 处理post请求(表单提交)
- HDU2222 Keywords Search AC自动机
- hdoj.1390 Binary Numbers 20140821
- URAL 1223. Chernobyl’ Eagle on a Roof
- BS组-培训-笔记20140821
- 解析AFNetWorking 网络框架(二)
- Session原理和Tomcat实现分析
- 本地服务-服务于访问者在同一进程
- HDU 2571 命运
- Java线程面试题Top50
- 【HDU】4973 A simple simulation problem. 线段树