// In the name of God
// Hope is last to die
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define pb push_back
// #define int long long
#define S second
#define F first
#define mp make_pair
#define smax(x, y) (x) = max((x), (y))
#define smin(x, y) (x) = min((x), (y))
#define all(x) (x).begin(), (x).end()
#define len(x) ((int)(x).size())
const int maxn = 1000 + 5;
const int inf = 1e9 + 7;
ll n, a[maxn];
int32_t main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n;
for(int i = 0; i < n; i++) cin >> a[i];
for(int i = 1; i < n; i++){
ll b = 63 - __builtin_clzll(a[i]);
for(int j = 0; j < i; j++){
ll x = 63 - __builtin_clzll(a[j]);
if((b / 4) == (x / 4)) cout << 1 << ' ';
else if((b / 16) == (x / 16)) cout << 2 << ' ';
else cout << 3 << ' ';
}
cout << '\n';
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
24 ms |
1248 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
21 ms |
1124 KB |
Output is correct |
12 |
Correct |
23 ms |
1364 KB |
Output is correct |
13 |
Correct |
21 ms |
1116 KB |
Output is correct |
14 |
Correct |
1 ms |
344 KB |
Output is correct |
15 |
Correct |
27 ms |
1112 KB |
Output is correct |
16 |
Correct |
21 ms |
1156 KB |
Output is correct |
17 |
Correct |
22 ms |
1112 KB |
Output is correct |
18 |
Correct |
21 ms |
1116 KB |
Output is correct |
19 |
Correct |
21 ms |
1116 KB |
Output is correct |
20 |
Correct |
22 ms |
1196 KB |
Output is correct |
21 |
Correct |
22 ms |
1200 KB |
Output is correct |
22 |
Correct |
22 ms |
1120 KB |
Output is correct |
23 |
Correct |
24 ms |
1372 KB |
Output is correct |