竞赛
考级
亚洲卷王
#include
超级大帅童……瑞*
1
👇🐎😭👌
CodePlay.
#include <bits/stdc++.h> using namespace std; long long n,a,sam=1; int main(){ cin>>n; if(n%2==1){ cout<<-1; return 0; } while(pow(2,sam)<=pow(10,7)){ if(pow(2,sam)==n){ cout<<n; return 0; } sam++; } while(n>=2){ int b=1; while(pow(2,b)<=n){ b+=1; } a=pow(2,(b-1)); n-=a; cout<<a<<" "; } return 0; }
我是坤坤
正在减肥的吃货
UPDATE
#include<bits/stdc++.h> using namespace std; int main(){ long long n; cin >> n; if(n % 2 == 1){ cout << -1; return 0; } long long pow2[105]; for(int i = 1;i <= 24;i++){ pow2[i] = pow(2,i); } whilehile(n != 0){ for(int i = 24;i >= 1;i--){ if(pow2[i] <= n && pow2[i+1] > n){ cout << pow2[i] << ' '; n -= pow2[i]; } } } return 0; }
DARK SPECTRE
#include<bits/stdc++.h> using namespace std; long long b[300]; int main(){ int a; cin>>a; }
张静瑄
132****6722
xm™
#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; int main(){ long long n; cin >> n; if(n % 2 == 1){ cout << -1; return 0; } long long pow2[105]; for(int i = 1;i <= 24;i++){ pow2[i] = pow(2,i); } while(n != 0){ for(int i = 24;i >= 1;i--){ if(pow2[i] <= n && pow2[i+1] > n){ cout << pow2[i] << ' '; n -= pow2[i]; } } } return 0; }
#include<iostream> using namespace std; int main(){ int a,b=2; cin>>a; if (a%2!=0){ cout<<-1; }else{ while (a>0){ for(int i=2;i<=a;i*=2){ b*=2; } b/=2; cout<<b<<" "; a=a-b; b=2; } } }
小垃圾
共36条