제출 #243576

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
243576		toonewbie	"The Lyuboyn" code (IZhO19_lyuboyn)	C++17	14 / 100	79 ms	9688 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);
    }
}

string binary(ll x) {
    string res = "";
    while(x > 0) {
        res += x % 2 + 48;
        x /= 2;
    }
    reverse(res.begin(), res.end());
    return res;
}

int main() {
    ios_base :: sync_with_stdio(0);
    cin.tie(0);
    int n, k, t;
    cin >> n >> k >> t;
    if (!(k & 1)) return cout << -1 << endl, 0;
    vector <ll> A;
    for (int i = 0; i < (1 << n); i++) {
        if (__builtin_popcount(i) == k) {
            add(A, i);
        }
    }
    cout << (1 << n) << 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) {
        string ans = binary(x);
        while(ans.size() < n) ans = '0' + ans;
        cout << ans << endl;
    }
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

lyuboyn.cpp: In function 'int main()':
lyuboyn.cpp:51:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while(ans.size() < n) ans = '0' + ans;
               ~~~~~~~~~~~^~~

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