JOJ ACM 1149
来源:互联网 发布:进销存软件源码 编辑:程序博客网 时间:2024/06/07 02:28
Given a positive integer n, nd 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.
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.
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.
Sample Input
113
Sample Output
0 2 3
code:
#include<iostream>#include<vector>using namespace std;void main(){int d,num;cin>>d;while(d!=0){ vector<int> v; cin>>num; while(num!=0) { v.push_back(num%2);num/=2; } for(int i=0;i<v.size();i++) { if(v[i]==1) { if(i!=v.size()-1) cout<<i<<" "; else cout<<i<<endl; } } d--;}}
- JOJ ACM 1149
- JOJ ACM 1237
- JOJ ACM 2155
- JOJ ACM 1148
- JOJ ACM 1146
- JOJ ACM 1107
- JOJ ACM 1184
- JOJ ACM 1061
- ACM JOJ 1062
- ACM JOJ 1007
- ACM JOJ 1023
- JOJ 2257
- joj 2319
- joj 2653
- JOJ 2687
- joj 2693
- joj 2443
- joj 1173
- 登录验证
- JOJ ACM 1148
- JOJ ACM 1146
- JOJ ACM 1107
- 买了台MP3
- JOJ ACM 1149
- JOJ ACM 1184
- 一生中最经典的话
- JOJ ACM 1061
- 爆炸也流行!!!
- 第一次在天涯上发贴,就遭到别人的唾骂
- 魔羯和水瓶--此情可待成追忆
- [转]Visual C++中DDB与DIB位图编程全攻略
- 程序员生涯第43天