#include "registers.h"
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define rep(i,a,b) for (int i = (a); i <= (b); i++)
#define repa(i,a,b) for (int i = (a); i >= (b); i--)
void construct_instructions(int s, int n, int k, int q) {
vector<bool> a;
a.resize(2000,0);
a[0] = 1;
append_store(1,a);
append_not(0,0);
//pongo los bits
append_and(2,1,0);
append_right(0,0,1);
if (k == 1) append_store(3,a);
else {
append_and(3,1,0);
append_right(0,0,1);
}
append_and(4,1,0);
append_right(0,0,1);
append_and(5,1,0);
append_move(0,8);
append_or(0,3,5);
append_right(0,0,1);
append_and(2,2,3);
append_and(4,4,5);
append_or(1,2,4);
append_add(0,0,1);
append_not(0,0);
a[1] = 1;
append_store(1,a);
append_and(0,0,1);
}
# |
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 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 |
0 ms |
212 KB |
Incorrect min value |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Incorrect sorting |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Incorrect sorting |
2 |
Halted |
0 ms |
0 KB |
- |