# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
515631 | | KoD | Hop (COCI21_hop) | C++17 | | 41 ms | 1284 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>
using std::vector;
using std::array;
using std::pair;
using std::tuple;
using i64 = std::int64_t;
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
int N;
std::cin >> N;
vector<int> log2(N);
for (auto& x : log2) {
i64 y;
std::cin >> y;
while (((i64)1 << x) < y) {
x += 1;
}
}
for (int i = 1; i < N; ++i) {
for (int j = 0; j < i; ++j) {
if (log2[i] / 16 != log2[j] / 16) {
std::cout << 1;
} else if (log2[i] / 4 != log2[j] / 4) {
std::cout << 2;
} else {
std::cout << 3;
}
std::cout << " \n"[j + 1 == i];
}
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |