Submission #19540289

---

Source Code Expand

// #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
 
using namespace std;
 
#define ll long long

const ll p = 1e9 + 7, nax = 505;

int ans[nax][nax];

void solve(int l, int r, int lvl) {
	if (l == r) return;
	int mid = (r + l) / 2;
	for (int i = l; i <= mid; i++) {
		for (int j = mid + 1; j <= r; ++j) {
			ans[i][j] = lvl;
			ans[j][i] = lvl;
		}
	}
	solve(l, mid, lvl + 1);
	solve(mid + 1, r, lvl + 1);
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	int n;
	cin >> n;
	solve(1, n, 1);
	for (int i = 1; i < n; ++i) {
		for (int j = i + 1; j <= n; ++j) {
			cout << ans[i][j] << ' ';
		}
		cout << '\n';
	}
}

Submission Info

Judge Result