杭电 HDU ACM 1390 Binary Numbers
来源:互联网 发布:c语言输出乘法口诀表 编辑:程序博客网 时间:2024/05/22 14:41
Binary Numbers
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3372 Accepted Submission(s): 2026
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
Source
Central Europe 2001, Practice
水:
用count记录每次的余数位置如果发现余数是1那么就输出他的位置即可;
#include<iostream>#include<cmath>using namespace std;int main(){int n,t,count;cin>>n;while(n--){count=0;cin>>t;int flag=0;while(t){count++;int x=t%2;if(x){if(flag)cout<<" "<<count-1;else {cout<<count-1;flag=1;}}t/=2;}cout<<endl;}return 0;}
0 0
- 杭电 HDU ACM 1390 Binary Numbers
- 杭电Hdu 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
- 杭电OJ题 1390 Binary Numbers解题报告
- 杭电ACM1390——Binary Numbers
- HDOJ 1058 Humble Numbers 杭电 ACM
- 6.19 杭电acm Humble Numbers
- 杭电acm—1058 Humble Numbers
- hdu-oj 1390 Binary Numbers
- HDU 1390 Binary Numbers(数学题)
- hdu 杭电acm 1002
- 杭电ACM HDU 1004
- 杭电ACM HDU 1002
- 总结-数据结构
- 阿里在线笔试题---乱序到来顺序输出
- 同一局域网内其它设备无法访问本地Apache问题的解决
- how to output quotes in bash prompt
- linux中bridge mode和NAT mode成功ping www.baidu.com必须注意检查核对的地方[操作系统为centos6.6版本]
- 杭电 HDU ACM 1390 Binary Numbers
- 今天开始,在此记录学习Linux嵌入式
- 历届试题 翻硬币
- Android恶意软件安装量2014年同比减半
- 黑马程序员——正则
- 第51题 Longest Valid Parentheses
- Git 学习笔记
- android开发红米note
- trie