zoukankan      html  css  js  c++  java
  • zoj 1383 Binary Numbers

    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 #include <iostream>
     2 #include <vector>
     3 using namespace std;
     4 int main(){
     5     int d, n, flag;
     6     vector<int> v;
     7     cin >> d;
     8     while(cin >> n){
     9         v.clear();
    10         while(n){
    11             int t = n % 2;
    12             v.push_back(t);
    13             n >>= 1;
    14         }
    15         flag = 0;
    16         for(int i = 0; i < v.size(); i++){
    17             if(v[i] == 1){
    18                 if(flag == 0){
    19                     cout << i;
    20                     flag = 1;
    21                 } else {
    22                     cout << " " << i;
    23                 }
    24             }
    25         }
    26         cout << endl;
    27     }
    28     //system("pause");
    29     return 0;
    30 }
  • 相关阅读:
    安装JDK,如何配置PATH,如何配置CLASSPATH
    存储过程笔记
    用BeanFactoryAware接口,用BEAN的名称来获取BEAN对象
    静态工厂实例代码
    setTimeout 和 setInterval 的区别
    Spring Autowire自动装配
    动态工厂模式代码实例
    JS处理回车事件
    不错的Spring学习笔记(转)
    单例模式要点
  • 原文地址:https://www.cnblogs.com/qinduanyinghua/p/6519562.html
Copyright © 2011-2022 走看看