ZOJ 1383 Binary Numbers 二进制数

最新推荐文章于 2021-03-12 19:13:30 发布

原创

最新推荐文章于 2021-03-12 19:13:30 发布 · 410 阅读

标签

#算法

收录于

该博客介绍了如何找出正整数在二进制表示中的1的位数。通过分析输入数据集，对每个正整数n，计算其二进制表示中1的位数，并按升序输出。示例给出了当n=13时，1的位数为0, 2, 3。程序实现可以通过将数字转换为二进制并跟踪1出现的位置来完成。" 8876417,1164043,AOE网与关键路径详解,"['算法', '图论', '工程管理', '优化']

题目来自ZOJ 1383 链接

题目

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 si