• [A] About Loop

  • 时间限制: 1000 ms 内存限制: 65535 K
  • 问题描述
  • This day, Death Moon told a story like that:

    One integer can be represented by a binary. For example:

    And you put the leftest ‘1’ to the rightest, it will be:

    Next loop it will be:

    And then the loop is end.

    So now give you a integer, you should print all of its loop in one line.


  • 输入
  • This problem contains several cases. Each case only contains one integer N (1 <= N <= 10000000000000000000).
  • 输出
  • For each case, you should print its whole loop in one line.
  • 样例输入
  • 7
    5
    
  • 样例输出
  • 7 7 7
    5 3 6
  • 提示
  • 来源
  • XadillaX
  • 操作

显示春菜