杭电OJ题 1390 Binary Numbers解题报告_航电oj1390题-优快云博客

本文链接：https://blog.youkuaiyun.com/Emacs_Linux/article/details/8518377

本文介绍了一个程序，该程序接收一个正整数n作为输入，并计算并输出其二进制表示中所有1的位置。样例展示了对于输入13，输出为0, 2, 3。

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

Binary Numbers

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

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

——————————————————————————————————————————————————
十进制与二进制的转换问题

/****************************
 *Name:Binary Numbers.c
 *Tags:ACM water
 ****************************/

#include <stdio.h>

int main()
{
      int d, num, f, s;
      scanf("%d", &d);
      while(d--) {
	    scanf("%d", &num);
	    s = 0;
	    f = 0;
	    while(num) {
		  if(num % 2 == 1) {
			if(f) {
			      printf(" %d", s);
			} else {
			      printf("%d", s);
			      f = 1;
			}
		  }
		  num /= 2;
		  s++;
	    }
	    printf("\n");
      }
      return 0;
}