forked from gojung/AlgorithmStudy
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathjava_1210.java
More file actions
44 lines (41 loc) · 1.07 KB
/
java_1210.java
File metadata and controls
44 lines (41 loc) · 1.07 KB
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
//SWEA 1210 Ladder1(D4)
import java.io.*;
public class java_1210 {
public static void main(String[] args) throws Exception{
BufferedReader br = new BufferedReader(new FileReader("input.txt"));
//BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int T = Integer.parseInt(br.readLine());
StringBuilder sb = new StringBuilder();
int dr[] = {0, 1, 0, -1};
int dc[] = {1, 0, -1, 0};
for(int t = 1; t <= T; t++) {
int N = Integer.parseInt(br.readLine());
int num = 1;
int r = 0;
int c = 0;
int[][]board = new int[N][N];
board[r][c] = num;
while(num < N*N) {
for(int d = 0; d < 4; d++) {
int nr = r + dr[d];
int nc = c + dc[d];
while(nr >= 0 && nr < N && nc >= 0 && nc < N && board[nr][nc] == 0) {
board[nr][nc] = ++num;
r = nr;
c = nc;
nr = nr + dr[d];
nc = nc + dc[d];
}
}
}
sb.append("#" + t + "\n");
for(int i = 0; i < N; i++) {
for(int j = 0; j < N; j++) {
sb.append(board[i][j]+ " ");
}
sb.append("\n");
}
}
System.out.print(sb);
}
}