forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathC.cpp
More file actions
38 lines (33 loc) · 939 Bytes
/
C.cpp
File metadata and controls
38 lines (33 loc) · 939 Bytes
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
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; ++i)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; --i)
#define REP(i,a) for(int i=0,_a=(a); i < _a; ++i)
#define DEBUG(X) { cout << #X << " = " << X << endl; }
#define PR(A,n) { cout << #A << " = "; FOR(_,1,n) cout << A[_] << ' '; cout << endl; }
#define PR0(A,n) { cout << #A << " = "; REP(_,n) cout << A[_] << ' '; cout << endl; }
#define sqr(x) ((x) * (x))
#define ll long long
#define SZ(x) ((int) (x).size())
using namespace std;
int n, k, a[555][555];
int main() {
ios :: sync_with_stdio(0); cin.tie(0);
while (cin >> n >> k) {
int last = n * n;
FOR(i,1,n) {
FORD(j,n,k) {
a[i][j] = last--;
}
}
FOR(i,1,n) {
FORD(j,k-1,1) a[i][j] = last--;
}
int sum = 0;
FOR(i,1,n) sum += a[i][k];
cout << sum << endl;
FOR(i,1,n) {
FOR(j,1,n) printf("%d ", a[i][j]);
puts("");
}
}
}