AC 代码
```
#include<bits/stdc++.h>
using namespace std;
int n,a[35]={},l = 0;
int main()
{
cin >> n;
if (n % 2 == 1)
{
cout << -1;
return 0;
}
for (int i = 0 ; n; i++)
{
a[i] = n % 2;
n /= 2;
++l;
}
l--;
for (int i = l; i>=0; i--)
{
if(a[i])
cout << (long long)(pow(2,i)) << " ";
}
return 0;
}
```
最后的输出从l-1到0。
~~本蒟蒻求互关~~
by wangtairan114 @ 2023-09-02 13:33:18