This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#include "registers.h"
using namespace std;
constexpr int m = 100;
constexpr int b = 10;
constexpr int B = 2000;
void construct_instructions(int s, int n, int k, int q) {
    assert(s==0);
    int used = 1;
    int mask, ones, half;
    vector<bool> maskv(B), onesv(B, 1), halfv(B);
    for (int i = 0; i < n; i++)
        maskv[k * (i+1) - k] = 1;
    for (int i = 0; i < b / 2; i++)
        halfv[i] = 1;
    append_store(mask = used++, maskv);
    append_store(ones = used++, onesv);
    append_store(half = used++, halfv);
    int ans = used++;
    for (int bit = k-1; bit >= 0; bit--) {
        int val, check, preserve_mask, curans;
        append_and(val = used++, 0, mask);
        append_xor(val, val, mask);
        append_add(check = used++, val, ones);
        append_right(curans = used++, check, b - 1);
        append_left(curans, curans, bit);
        append_or(ans, ans, curans);
        append_right(check, check, b/2);
        append_xor(val, val, mask);
        append_and(preserve_mask = used++, mask, check);
        append_or(mask, val, preserve_mask);
        append_right(mask, mask, 1);
    }
    append_move(0, ans);
}
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... |