#include <iostream> #include <vector> using namespace std; int main() { long long n; cin >> n; }

#include<bits/stdc++.h> using namespace std; int main(){ int n,ans[10000],idx=0; 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))<<" "; }

#include<bits/stdc++.h> using namespace std; int main(){ int n,ans[10000],idx=0; 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))<<" "; }

#include <bits/stdc++.h> using namespace std; long long n,ans,j = 1; int main(){ cin>>n; if(n%2==1){ ans = -1; cout<<ans; return 0; } while(pow(2,j)<10000000){ if(pow(2,j)==n){ ans = n; cout<<ans; return 0; } j++; } while(n>=2){ int tmp = 1; while(pow(2,tmp)<=n){ tmp+=1; } ans = pow(2,(tmp-1)); n-=ans; cout<<ans<<" "; } return 0; }

#include <bits/stdc++.h> using namespace std; long long n,ans,j = 1; int main(){ cin>>n; if(n%2==1){ ans = -1; cout<<ans; return 0; } while(pow(2,j)<10000000){ if(pow(2,j)==n){ ans = n; cout<<ans; return 0; } j++; } while(n>=2){ int tmp = 1; while(pow(2,tmp)<=n){ tmp+=1; } ans = pow(2,(tmp-1)); n-=ans; cout<<ans<<" "; } return 0; }

#include <iostream> #include <cmath> #include <cstdio> using namespace std; int n,a[30],idx; void change(int b){ int res=0; while(b){ if (b&1) a[res]=pow(2,res); res++; b>>=1; } idx=res; } int main(){ scanf("%d",&n); if (n%21 || n0){ printf("-1"); return 0; } change(n); for(int i=idx;i>=1;i--) if (a[i]!=0) printf("%d ",a[i]); return 0; }

#include <bits/stdc++.h> using namespace std; int main(){ int a; cin>>a; int y=1; if(a%2!=0){ cout<<"-1"; } else{ while(y<a){ y=2*y; } while(a>1){ while(y>a){ y=y/2; } a=a-y; cout<<y<<" "; } } }

#include<stdio.h> long long pw(int a,int b){ for(int i=0;i<b;i++){ a*=2; } return a; } int main(){ long long a,cnt=0; scanf("%lld",&a); if(a%2==1){ printf("%d",-1); return 0; } bool aa[32]; while(a){ aa[cnt++]=a%2; a/=2; } }