제출 #243574

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
243574		toonewbie	"The Lyuboyn" code (IZhO19_lyuboyn)	C++17	0 / 100	34 ms	6500 KiB

lyuboyn

#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define endl '\n'

const int MOD = 1e9 + 7;
const int N = 10005;

void add(vector<ll> &bs, ll A) {
    for (ll x : bs) A = min(A, A ^ x);
    if (A) {
        bs.push_back(A);
    }
}

int main() {
    ios_base :: sync_with_stdio(0);
    cin.tie(0);
    int n, k;
    cin >> n >> k;
    if (!(k & 1)) return cout << "NO" << endl, 0;
    vector <ll> A;
    for (int i = 0; i < (1 << n); i++) {
        if (__builtin_popcount(i) == k) {
            add(A, i);
        }
    }
    cout << "YES" << endl;
    vector <ll> v, tmp; v.push_back(0); tmp = v;
    for (ll cur : A) {
        for (ll x : tmp) {
            v.push_back(cur ^ x);
        }
        tmp = v;
        reverse(tmp.begin(), tmp.end());
    }
    for (ll x : v) {
        cout << x << endl;
    }
    return 0;
}

• Subtask 1: 0 / 0
• Subtask 2: 0 / 5
• Subtask 3: 0 / 3
• Subtask 4: 0 / 11
• Subtask 5: 0 / 15
• Subtask 6: 0 / 18
• Subtask 7: 0 / 31
• Subtask 8: 0 / 17