75分
查看原帖
75分
1430942
qiaohaoran123楼主2025/6/27 20:13

记录

代码:

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,n_2[25]={0,2,4,8,16,32,64,128,256,512,1024,2048,4096,8192,16384,32768,65536,131072,262144,524288,1048576,2097152,4194304,8388608,16777216};
ll a[25],m;
void f(ll sum,ll last,ll p){
	if(sum>n)return;
	if(sum==n&&p>=2){
		for(int i=1;i<=p;i++)cout<<a[i]<<" ";
		exit(0);
	}
	for(int i=last-1;i>=1;i--){
		a[p+1]=n_2[i];
		f(sum+n_2[i],i,p+1);
	}
	return;
}
int main(){
	ios::sync_with_stdio(false);
	cin>>n;
	m=log2(n);
	f(0,25,0);
	cout<<-1;
	return 0;
}
2025/6/27 20:13
加载中...