#include "registers.h"
#include <bits/stdc++.h>
using namespace std;
const int m = 100;
const int b = 2000;
void construct_instructions(int s, int n, int k, int q) {
if(k == 1) {
append_move(1, 0);
append_right(1, 1, 1);
append_and(0, 0, 1);
} else {
append_right(1, 0, 0);
append_right(2, 0, 1);
append_right(3, 0, 2);
append_right(4, 0, 3);
append_xor(5, 1, 2);
append_xor(6, 2, 3);
append_not(7, 6);
append_xor(8, 3, 4);
append_and(9, 5, 8);
append_and(10, 9, 7);
vector<bool> v(b, false); v[0] = true;
append_store(11, v);
append_and(12, 10, 11);
append_and(0, 0, 3);
append_or(0, 0, 12);
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
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 |
0 ms |
300 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 |
- |