Codeforces Round 922 (Div. 2) | JorbanS

A - Brick Wall

int solve() {
    cin >> n >> m;
    int res = m / 2 * n;
    return res;
}

B - Minimize Inversions

void solve() {
    cin >> n;
    for (int i = 0; i < n; i ++) cin >> a[i].aa, a[i].bb = i;    
    for (int i = 0; i < n; i ++) cin >> b[i];
    sort(a, a + n);
    for (int i = 0; i < n; i ++) c[i] = b[a[i].bb];
    for (int i = 0; i < n; i ++) cout << i + 1 << ' ';
    cout << endl;
    for (int i = 0; i < n; i ++) cout << c[i] << ' ';
    cout << endl;
}

C - XOR-distance

ll solve() {
    cin >> a >> b >> r;
    if (a < b) swap(a, b);
    if (a == b) return 0;
    int t;
    for (int i = 0; i <= 60; i ++)
        if ((a ^ b) & 1ll << i) t = i;
    ll res = 0;
    for (int i = t - 1; i >= 0; i --)
        if ((a & 1ll << i) && !(b & 1ll << i) && res + (1ll << i) <= r)
            res |= 1ll << i;
    return (a ^ res) - (b ^ res);
}