# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1142234 | SulA | cmp (balkan11_cmp) | C++20 | 889 ms | 96172 KiB |
#include "cmp.h"
#include <iostream>
#include <string>
using namespace std;
int cum[7];
//string quat(int n) {
// string s(6, '0');
// for (int i = 0; i < 6; i++)
// s[i] += (n >> i*2) & 3;
// reverse(s.begin(), s.end());
// return s;
//}
void remember(int a) {
cum[0] = 1;
for (int i = 1; i < 7; i++) {
cum[i] = cum[i-1] + (1 << (14 - 2*i));
}
for (int i = 0; i < 7; i++) {
bit_set(cum[i] + (a >> i*2));
// cout << quat((a >> i*2)) << '\n';
}
// cout<<'\n';
}
int compare(int b) {
// cout<<quat(b)<<'\n';
for (int i = 5; i >= 0; i--) if (!bit_get(cum[i] + (b >> i*2))) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |