#include<bits/stdc++.h> using namespace std; int main(){ ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; cin>>n; vector<int> dp(n+1); dp[0] = 0; for(int i= 1; i <= n; i++){ int k = dp[i-1]; while(!(dp[i - __builtin_popcount(k)] < k))k++; dp[i] = k; } //for(int i= 0; i <= n; i++)cout<<dp[i]<<" "; int current = n; vector<int> ans; while(current > 0){ ans.push_back(dp[current]); current -= __builtin_popcount(dp[current]); } cout<<ans.size()<<"\n"; for(auto x : ans)cout<<x<<" "; cout<<"\n"; return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 | #include<bits/stdc++.h> using namespace std; int main(){ ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; cin>>n; vector<int> dp(n+1); dp[0] = 0; for(int i= 1; i <= n; i++){ int k = dp[i-1]; while(!(dp[i - __builtin_popcount(k)] < k))k++; dp[i] = k; } //for(int i= 0; i <= n; i++)cout<<dp[i]<<" "; int current = n; vector<int> ans; while(current > 0){ ans.push_back(dp[current]); current -= __builtin_popcount(dp[current]); } cout<<ans.size()<<"\n"; for(auto x : ans)cout<<x<<" "; cout<<"\n"; return 0; } |