ZOJ Problem Set - 1383 Binary Numbers

本文详细介绍了如何将十进制数转换为二进制,并通过位运算找出二进制数中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


Source: Central Europe 2001, Practice




分析:

十进制转二进制的水题。输出稍微注意一下。

ac代码:

#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
bool c[100];
int main()
{
    int d,n,i,j;
    scanf("%d",&d);
    //memset()
    while(d--)
    {
        memset(c,0,sizeof(c));
        scanf("%d",&n);
        for(i=0;n>=1;i++)
        {
            c[i]=n%2;
            n/=2;
        }
        bool flag=0;
        for(j=0;j<i;j++)
        {
            if(c[j]==1) 
            {
                if(!flag) 
                {
                     flag=1;
                     printf("%d",j);
                }
                else printf(" %d",j);
            }
            
        }
        printf("\n");
    }
    return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值