zoj1383Binary Numbers

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

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

0 ·

CC 4.0 BY-SA版权

本文介绍了一种算法，用于找出一个正整数二进制表示中所有1的位置，并使用队列来存储这些位置。该算法适用于计算机科学领域的数据结构与算法设计。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

题意：统计一个数的二进制表示中，1所在的位置，注意是从0开始的。我的做法是将1的位置用队列存放了。

#include<stdio.h>
#include<queue>
using namespace std;
int main()
{
	int n,number,i;
	scanf("%d",&n);
	queue<int>q;
	while(n--)
	{
		i=0;
		scanf("%d",&number);
		while(number)
		{
			if(number%2)
				q.push(i);
			number=number/2;
			i++;
		}
		q.push(-1);
	}
	while(!q.empty())
	{
		i=q.front();q.pop();
		if(q.front()!=-1)
			printf("%d ",i);
		else 
		{
			printf("%d\n",i);
			q.pop();
		}
	}
	return 0;
}