abc269C - Submask（位运算）

个人思路

// Date: 2022-10-10 10:33:47
// Problem: C - Submask
// Contest: AtCoder - UNICORN Programming Contest 2022(AtCoder Beginner Contest 269)
// URL: https://atcoder.jp/contests/abc269/tasks/abc269_c
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// --------By WIDA--------

#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define int LL
const int N = 1e6 + 7;

set<int> ans;
void dfs(bitset<60> x) {
	ans.insert(x.to_ullong());
	for (int i = 0; i < 62; ++ i) {
		if (x[i] == 0) continue;
		x[i] = 0;
		if (!ans.count(x.to_ullong())) dfs(x);
		x[i] = 1;
	}
}
signed main() {
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	
	int n; cin >> n;
	bitset<60> B = n;
	dfs(B);
	for (auto it : ans) cout << it << "\n";
	
	return 0;
}

大佬思路

摘自本篇博客。

#include <bits/stdc++.h>
#define int long long
using namespace std;
int x;
stack<int> st;

signed main() {
    cin >> x;
    for (int i = x; i; i = (i - 1) & x) st.push(i);
    cout << 0 << endl;
    while (!st.empty()) {
        cout << st.top() << endl;
        st.pop();
    }
    return 0;
}