ZOJ Problem Set–1383 Binary Numbers
2012-03-12 22:52
471 查看
Time Limit: 2 Seconds Memory Limit: 65536 KB
Given a positive integer n, print out 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
1
13
Sample Output
0 2 3
Source: Central Europe 2001, Practice
注意输出格式中的空格的控制!
Given a positive integer n, print out 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
1
13
Sample Output
0 2 3
Source: Central Europe 2001, Practice
注意输出格式中的空格的控制!
#include<iostream>
using namespace std;
int main()
{
int nums;cin>>nums;
int number;
while(nums-- && cin>>number)
{
int j = 0;
for(int i = 0; number; number >>= 1, i++)
{
if(number&1 > 0)
{
if(j != 0)
cout<<" ";
cout<<i;
j++;
}
}
cout<<endl;
}
return 0;
}
相关文章推荐
- ZOJ Problem Set - 1383 Binary Numbers
- ZOJ Problem Set - 1383 Binary Numbers
- ZOJ Problem Set - 1383 Binary Numbers
- ZOJ Problem Set–1797 Least Common Multiple
- ZOJ Problem Set–2060 Fibonacci Again
- ZOJ Problem Set – 1056 The Worm Turns
- ZOJ Problem Set–1951 Goldbach's Conjecture
- ZOJ Problem Set–1712 Skew Binary
- ZOJ Problem Set–1884 WERTYU
- ZOJ Problem Set–2781 Rounders
- ZOJ Problem Set–1241 Geometry Made Simple
- ZOJ Problem Set–1755 Clay Bully
- ZOJ Problem Set–1078 Palindrom Numbers
- ZOJ Problem Set–1949 Error Correction
- ZOJ Problem Set–1494 Climbing Worm
- ZOJ Problem Set–1402 Magnificent Meatballs
- ZOJ Problem Set–1874 Primary Arithmetic
- ZOJ Problem Set–1331 Perfect Cubes
- ZOJ Problem Set–1205 Martian Addition
- ZOJ Problem Set–1489 2^x mod n = 1