优秀的拆分题解

#include <bits/stdc++.h>
using namespace std;
int n,ans[10086],idx = 0;
int main(){
	cin >> n;
	if(n % 2 == 1){
        cout << -1;
        return 0;
    }
	while(n > 0){
		ans[idx] = n % 2;
		idx ++;	
		n /= 2;
	} 
	for(int i = idx - 1;i >= 0;i --)
		if(ans[i] == 1) cout << (int)(ans[i] * pow(2,i)) << " ";
	return 0;
}