| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1056827 | user736482 | Bit Shift Registers (IOI21_registers) | C++17 | 0 ms | 0 KiB | 
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;
vector<bool>zera,jeden4;
void minimum(int a,int b,int t){
    append_store(t,zera);
   //   append_move(98,a);
    append_not(98,a);
    append_add(98,b,98);
    append_right(98,98,10);
    append_and(t,b,98);
    append_not(98,98);
    append_and(t,a,98);
    /*zera[0]=1;
    append_store(98,zera);
    zera[0]=0;
    append_add(98,b,98);
    append_not(98);
    append_add(98,a,98);
    append_left(98,10,98);
    append_and(t,b,98);*/
}
void construct_instructions(int s, int n, int k, int q){
    for(int i=0;i<2000;i++){
        zera.push_back(0);
        jeden4.push_back(0);
        if(i<k)
            jeden4[i]=1;
    }
    //append_right(0,k,0);
    //append_move(1,0);
    append_right(1,0,k);
    append_store(2,jeden4);
    append_and(0,2,0);
    minimum(0,1,3);
    append_move(0,3);
}
