HDU 1390 Binary Numbers

最新推荐文章于 2019-11-11 18:18:12 发布

香草咖啡有点甜

最新推荐文章于 2019-11-11 18:18:12 发布

阅读量742

点赞数

CC 4.0 BY-SA版权

分类专栏： ACM题目解析文章标签： numbers integer input output each

本文链接：https://blog.youkuaiyun.com/ZCY20121105/article/details/7854991

ACM题目解析专栏收录该内容

146 篇文章

订阅专栏

本文介绍了一种算法，用于找出任意正整数在二进制表示中所有1的位置，并提供了一个具体的实现示例。

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

Binary Numbers

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1778 Accepted Submission(s): 1121

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.

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的位置，并输出。

AC代码：

#include<iostream>
using namespace std;
int main()
{
	int t,n,i,f;
	while(scanf("%d",&t)!=EOF)
	{
		while(t--)
		{
			scanf("%d",&n);
			f=1;
			for(i=0;n!=0;i++)
			{
				if(n%2==1&&f==0)printf(" %d",i);
				if(n%2==1&&f==1){printf("%d",i);f=0;}
				n/=2;
			}
			printf("\n");
		}
	}
	return 0;
}