#include "registers.h"
#include <bits/stdc++.h>
#define ll int
using namespace std;
vector<bool> v(2000);
void construct_instructions(int s, int n, int k, int q) {
if(n==2){
append_move(1,0);
append_right(1,0,k);
v[0] = 1;
append_store(99,v); /// 1
v[0] = 0;
v[1] = 1;
append_store(98,v); /// 2
v[0] = 1;
append_store(97,v); /// 3
if(k==1){
append_and(0,0,1);
}else{
append_xor(2,0,1);
append_and(3,2,99);
append_xor(4,3,99);
append_add(5,4,99);
append_not(6,5);
append_and(7,6,97);
append_xor(0,7,2);
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Incorrect min value |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Incorrect min value |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
296 KB |
Incorrect min value |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Incorrect min value |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Incorrect sorting |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Incorrect sorting |
2 |
Halted |
0 ms |
0 KB |
- |