Submission #69174256

---

Source Code Expand

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
typedef long long ll;
using namespace std;
using namespace __gnu_pbds;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef tuple<int, int, int> ti;
typedef vector<bool> vb;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> OS;
//FOR BLITZ READING INPUT/OUTPUT TEXT FILES
//ifstream fin("input.txt");
//ofstream fout("output.txt");
//IF USING ABOVE, USE 'fin' AND 'fout' INSTEAD OF 'cin' AND 'cout' !!!!!!

void solve() {
    int n, k;
    cin >> n >> k;
    int tot = 1 << n;
    int avg = k / tot;
    vll res(tot, avg);
    int extra = k % tot;
    int num = 0;
    if (extra != 0) {
        num = 1;
        int cur = 1;
        int bs = tot;
        while (cur < extra) {
            cur <<= 1;
            bs >>= 1;
        }
        for (int i = 0; i < extra; i++) res[bs * i]++;
    }
    cout << num << endl;
    for (auto x: res) cout << x << " ";
    cout << endl;
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int test = 1;
    //cin >> test;
    for (int t = 0; t < test; t++) {
        solve();
    }
}

Submission Info

Judge Result