codeforces-study/CF_1487C.cpp at master · cp-study/codeforces-study · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
#include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <functional>
#include <cstdlib>
#include <list>
#include <iomanip>
#define ll long long
#define MOD 1000000007
using namespace std;

int main() {
	int T;
	cin >> T;

	for (int t = 0; t < T; t++) {
		int N;
		cin >> N;
		if (N % 2 == 1) {
			for (int i = 2; i <= N; i++) {
				for (int j = i; j <= N; j++) {
					if (j-i+1 <= (N-1) / 2) {
						cout << 1 << " ";
					}
					else {
						cout << -1 << " ";
					}
				}
			}
		}
		else {
			for (int i = 2; i <= N; i++) {
				for (int j = i; j <= N; j++) {
					if (j-i+1 < N / 2) {
						cout << 1 << " ";
					}
					else if (j-i+1== N / 2) {
						cout << 0 << " ";
					}
					else {
						cout << -1 << " ";
					}
				}
			}
		}
		cout << endl;
	}
}