ZOJ1383-Binary Numbers

最新推荐文章于 2020-06-06 18:26:58 发布

原创最新推荐文章于 2020-06-06 18:26:58 发布 · 652 阅读

0 ·

CC 4.0 BY-SA版权

----水题同时被 2 个专栏收录

234 篇文章

订阅专栏

ZOJ

120 篇文章

订阅专栏

本文介绍了一个程序设计任务，即对于给定的正整数n，找出并打印其二进制表示中所有1的位置。文章包含了一个示例输入输出，并提供了一段C++代码实现该功能。

Binary Numbers

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

题意：给定一个正整数n，要求输出对应的二进制数中所有数码‘1’的位置。注意最低位为第0位。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <vector>
#include <bitset>

using namespace std;

#define LL long long
const LL INF = 0x3f3f3f3f3f3f3f3f;
const double pi = acos(-1.0);
const double eps = 1e-8;

int main()
{
	int t, n;
	scanf("%d", &t);
	while (t--)
	{
		scanf("%d", &n);
		int flag = 0;
		for(int i=0;i<20;i++)
		{
			if (n&(1<<i))
			{
				if (flag++) printf(" ");
				printf("%d", i);
			}
		}
		printf("\n");
	}
	return 0;
}