#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cctype>
#include <string>
#include <queue>
#include <unordered_set>
#include <deque>
#include <numeric>
#include <queue>
using namespace std;
//#pragma GCC optimize("O3")
//#pragma GCC optimization("Ofast,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> gb(n);
for (int i = 0; i < n; ++i) {
ll x;
cin >> x;
for (int b = 62; b > -1; --b) {
if ((x >> b) & 1) {
gb[i] = b;
break;
}
}
}
for (int i = 1; i < n; ++i) {
for (int j = 0; j < i; ++j) {
if (gb[i] / 4 == gb[j] / 4) {
cout << 1 << ' ';
} else if (gb[i] / 16 == gb[j] / 16) {
cout << 2 << ' ';
} else {
cout << 3 << ' ';
}
}
cout << '\n';
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |