Submission #999603

---

Source Code Expand

#include <string>
#include <vector>
#include <iomanip>
#include <iostream>
#include <algorithm>
using namespace std;
int n, a[109][109];
int main() {
	cin >> n;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n - 1; j++) {
			a[i][j] = (i + j + 1) % n + 1;
		}
	}
	if (n == 2) cout << -1 << endl;
	else {
		if (n % 2 == 0) {
			for (int i = 0; i < n / 2; i++) swap(a[i][0], a[i][n / 2 - 1]);
		}
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n - 1; j++) {
				if (j) cout << ' ';
				cout << a[i][j];
			}
			cout << endl;
		}
	}
	return 0;
}

Submission Info

Judge Result