https://codeforces.com/contest/1152/problem/B

題解：模擬+貪心

/* *@Author: STZG *@Language: C++ */ #include <bits/stdc++.h> #include<iostream> #include<algorithm> #include<cstdlib> #include<cstring> #include<cstdio> #include<string> #include<vector> #include<bitset> #include<queue> #include<deque> #include<stack> #include<cmath> #include<list> #include<map> #include<set> //#define DEBUG #define RI register int #define endl "\n" using namespace std; typedef long long ll; //typedef __int128 lll; const int N=100000+10; const int M=100000+10; const int MOD=1e9+7; const double PI = acos(-1.0); const double EXP = 1E-8; const int INF = 0x3f3f3f3f; int t,n,m,k,p,l,r,u,v; int ans,cnt,flag,temp,sum; int a[N],b[N]; char str; struct node{}; int main() { #ifdef DEBUGfreopen("input.in", "r", stdin);//freopen("output.out", "w", stdout); #endif//ios::sync_with_stdio(false);//cin.tie(0);//cout.tie(0);//scanf("%d",&t);//while(t--){scanf("%d",&n);t=n;while(t){sum+=t%2;a[++ans]=t%2;t/=2;}if(ans==sum){cout<<0<<endl;return 0;}flag=1;cnt=0;while(1){flag=0;for(int i=ans;i>=1;i--){if(!a[i]){flag=1;b[++cnt]=i;break;}}if(flag){for(int i=b[cnt];i>=1;i--){a[i]^=1;}}else{break;}flag=0;for(int i=ans;i>=1;i--){if(!a[i]){flag=1;}}if(flag){a[1]+=1;cnt++;for(int i=2;i<=ans;i++){a[i]=a[i]+a[i-1]/2;a[i-1]%=2;}}else{break;}}cout<<cnt<<endl;for(int i=1;i<=cnt;i+=2){cout<<b[i]<<" ";}//}#ifdef DEBUGprintf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC); #endif//cout << "Hello world!" << endl;return 0; }

?

總結

以上是生活随笔為你收集整理的Neko Performs Cat Furrier Transform的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。