HDU Binary Numbers 1390(转换+统计)
来源:互联网 发布:聚类算法数据集 编辑:程序博客网 时间:2024/05/17 01:21
Binary Numbers
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4620 Accepted Submission(s): 2834
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
题解:就是求出这个数的二进制,然后求出二进制中的 '1'的位置。
AC代码:
#include<iostream>#include<cstdlib>#include<cstdio>#include<cmath>#include<cstring>#include<string>#include<cstdlib>#include<iomanip>#include<algorithm>#include<time.h>typedef long long LL;using namespace std;int main(){ int t,n; cin>>t; while(t--) { cin>>n; int a[50],k=0; while(n) { a[k++]=n%2; n=n>>1; } for(int i=0; i<k; i++) if(a[i]) { cout<<i; if(i!=k-1) cout<<" "; } cout<<endl; }return 0;}
1 0
- HDU Binary Numbers 1390(转换+统计)
- 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
- hdu-oj 1390 Binary Numbers
- HDU 1390 Binary Numbers(数学题)
- HDU 1390 || ZOJ 1383 Binary Numbers
- 杭电Hdu 1390 Binary Numbers
- 杭电 HDU ACM 1390 Binary Numbers
- hdu - 4321 - Arcane Numbers 2 - 数位统计
- hdoj.1390 Binary Numbers 20140821
- HDOJ 1390 Binary Numbers(水题)
- Binary Numbers
- Binary Numbers
- 排序算法之希尔排序
- 【LeetCode-142】Linked List Cycle II
- Java回调机制(CallBack)详解
- Win7(64bit)下安装Docker
- 判别器组合算法——Bagging与随机森林
- HDU Binary Numbers 1390(转换+统计)
- Linux系统使用Ant打包Android项目
- 【SASS-01】Sass安装与使用
- java枚举应用(二)
- Lambda表达式 《自学系列》
- DevExpress控件-TreeList内置过滤功能实现(图文)
- javaweb学习总结(四)——Http协议
- jquery autocomplete插件 实现输入框自动补全
- uva11383(KM算法)