CSP-J2 2020 T1 优秀的拆分

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>

using namespace std;

int main() {
	int n;
	cin>>n;

	int maxn = 1024 * 1024 * 4 //2的32次方
	
	if(n % 2 == 1) { //判断奇偶
		cout<<-1<<endl; 
		return 0;
	}
	
	while(n > 0) { //主要算法
		if(n > maxn) {
			cout<<maxn<<" ";
			n -= maxn;
		}
		maxn /= 2;
	}
	return 0;
}