B. Neko Performs Cat Furrier Transform

// Problem: B. Neko Performs Cat Furrier Transform
// Contest: Codeforces - Codeforces Round #554 (Div. 2)
// URL: https://codeforces.com/problemset/problem/1152/B
// Memory Limit: 256 MB
// Time Limit: 1000 ms
// 2022-03-04 19:11:39
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
using namespace std;

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define pii pair<int, int>
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define mp make_pair

const ll mod = 1e9 + 7;

inline ll qmi (ll a, ll b) {
	ll ans = 1;
	while (b) {
		if (b & 1) ans = ans * a%mod;
		a = a * a %mod;
		b >>= 1;
	}
	return ans;
}
inline int read () {
	int x = 0, f = 0;
	char ch = getchar();
	while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
	while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	return f?-x:x;
}
template<typename T> void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) print(x/10);
	putchar(x % 10 + '0');
}
inline ll sub (ll a, ll b) {
	return ((a - b ) %mod + mod) %mod;
}
inline ll add (ll a, ll b) {
	return (a + b) %mod;
}
inline ll inv (ll a) {
	return qmi(a, mod - 2);
}

bool check (int x) {
	while (x) {
		if (!(x & 1)) return 0;
		x >>= 1;
	}
	return 1;
}
#define int long long
string get (int x) {
	string s = "";
	while (x) {
		if (x & 1) s += "1";
		else s += "0";
		x >>= 1;
	}
	return s;
}
void solve() {
	int x;
	cin >> x;
	vector<int> ans;
	if (check(x)) {
		puts("0");
		return;
	}
	for (int i = 1; i <= 40; i ++) {
		if (i % 2 == 0) {
			x ++;
		}
		else {
			string s = get(x);
			for (int j = s.size() - 1; j >= 0; j --) {
				if (s[j] == '0') {
					x ^= ((1 << (j + 1)) - 1);
					ans.pb(j + 1);
					break;
				}
			}
		}
		if (check(x)) {
			cout << i << endl;
			break;
		}
	}
	for (auto t :ans) cout << t << ' ';
	puts("");
}
signed main () {
    int t;
    t =1;
    //cin >> t;
    while (t --) solve();
    return 0;
}

从高位找第一个0.这时到低位的长度就是选择的n，这样就会产生贡献。贪心