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
#include <cstdio>
#include <iostream>
#include <cmath>
using namespace std;

int main() {
	long n;
	long long m;
	long long t;
	long long* a;
	scanf("%ld %lld\n", &n, &t);
	m = pow(n, 2);
	a = new long long[m];

	for (int i = 0; i < m; i++) {
		long long x;
		scanf("%lld", &x);
		a[i] = x;
	}

	if (t & 1) {
		for (int i = m - 1; i >= 0; i--) {
			if (i == 0) {
				printf("%ld\n", a[i]);
			} else {
				printf("%ld ", a[i]);
			}
		}
	} else {
		for (int i = 0; i < m; i++) {
			if (i == m - 1) {
				printf("%ld\n", a[i]);
			} else {
				printf("%ld ", a[i]);
			}
		}
	}

	return 0;
}