728x90
반응형
|
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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Main{
static int N, M, R;
static int[][] map;
static int[][] tMap;//수정된 배열
public static void main(String[] args) throws NumberFormatException, IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringBuilder sb = new StringBuilder();
StringTokenizer st;
st = new StringTokenizer(br.readLine());
N = Integer.parseInt(st.nextToken());// 행개수 짝수
M = Integer.parseInt(st.nextToken());// 열개수 짝수
R = Integer.parseInt(st.nextToken());// 연산수
int min = Math.min(N, M) / 2;// 백준에서 이미 조건줌
map= new int[N][M];
for (int i = 0; i < N; i++) {
st = new StringTokenizer(br.readLine());
for (int j = 0; j < M; j++) {
map[i][j] = Integer.parseInt(st.nextToken());
}
}
st = new StringTokenizer(br.readLine());
for (int i = 0; i < R; i++) {
int n = Integer.parseInt(st.nextToken());
switch (n) {
case 1:
upAndDown() ;
break;
case 2:
rightAndLeft();
break;
case 3:
right90();
break;
case 4:
left90();
break;
case 5:
clock();
break;
case 6:
reversalClock();
break;
}
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
sb.append(map[i][j] + " ");
}
sb.append("\n");
}
System.out.println(sb);
}
public static void upAndDown() {// 상하
tMap = new int[N][M];
for(int i=0;i<N;i++) {
for(int j=0;j<M;j++) {
tMap[N-i-1][j]=map[i][j];
}
}
map=tMap;
}
public static void rightAndLeft() {// 좌우
tMap = new int[N][M];
for(int i=0;i<N;i++) {
for(int j=0;j<M;j++) {
tMap[i][M-j-1]=map[i][j];
}
}
map=tMap;
}
public static void right90() {//오른쪽 90도
tMap = new int[M][N];
for(int i=0; i<N; i++){
for(int j=0; j<M; j++){
tMap[j][N-i-1] = map[i][j];
}
}
int tmp = N;
N = M;
M= tmp;
map = tMap;
}
public static void left90() {//왼쪽 90도
tMap = new int[M][N];
for(int i=0; i<N; i++){
for(int j=0; j<M; j++){
tMap[M-j-1][i] = map[i][j];
}
}
int tmp = N;
N = M;
M= tmp;
map = tMap;
}
public static void clock() {//시계방향
tMap = new int[N][M];
for(int i=0; i<N/2; i++){
for(int j=0; j<M/2; j++){
tMap[i][M/2+j] = map[i][j];
}
}
for(int i=0; i<N/2; i++){
for(int j=M/2; j<M; j++){
tMap[N/2+i][j] = map[i][j];
}
}
for(int i=N/2; i<N; i++){
for(int j=M/2; j<M; j++){
tMap[i][j-M/2] = map[i][j];
}
}
for(int i=N/2; i<N; i++){
for(int j=0; j<M/2; j++){
tMap[i-N/2][j] = map[i][j];
}
}
map = tMap;
}
public static void reversalClock() {//반시계방향
tMap = new int[N][M];
for(int i=0; i<N/2; i++){
for(int j=0; j<M/2; j++){
tMap[N/2+i][j] = map[i][j];
}
}
for(int i=N/2; i<N; i++){
for(int j=0; j<M/2; j++){
tMap[i][j+M/2] = map[i][j];
}
}
for(int i=N/2; i<N; i++){
for(int j=M/2; j<M; j++){
tMap[i-N/2][j] = map[i][j];
}
}
for(int i=0; i<N/2; i++){
for(int j=M/2; j<M; j++){
tMap[i][j-M/2] = map[i][j];
}
}
map = tMap;
}
}
|
cs |
728x90
반응형
'알고리즘 > 백준' 카테고리의 다른 글
| [백준]14969_딱지놀이 (0) | 2022.02.15 |
|---|---|
| [백준]3040_백설 공주와 일곱 난쟁이 (0) | 2022.02.15 |
| [백준]16926_배열돌리기1 (0) | 2022.02.09 |
| 백준-10430번-java-나머지 (0) | 2021.06.08 |
| 백준-10869번-java-사칙연산 (0) | 2021.06.08 |