[20250817] BOJ / G5 / 배열 돌리기1 / 이인희

Author: LiiNi-coder

LiiNi-coder/202508/17 BOJ 배열 돌리기 1.md

@@ -0,0 +1,69 @@
+```java
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+
+        int N = Integer.parseInt(st.nextToken());
+        int M = Integer.parseInt(st.nextToken());
+        int R = Integer.parseInt(st.nextToken());
+
+        int[][] 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());
+            }
+        }
+        int layers = Math.min(N, M) / 2;
+        int[] dr = {0, 1, 0, -1};
+        int[] dc = {1, 0, -1, 0};
+        for (int layer = 0; layer < layers; layer++) {
+            List<Integer> list = new ArrayList<>();
+            int r = layer, c = layer;
+            //경계 길이
+            int height = N - 2 * layer;
+            int width = M - 2 * layer;
+            
+            //한바퀴 돌기
+            for (int d = 0; d < 4; d++) {
+                int len = (d % 2 == 0) ? width - 1 : height - 1;
+                for (int k = 0; k < len; k++) {
+                    list.add(map[r][c]);
+                    r += dr[d];
+                    c += dc[d];
+                }
+            }
+
+            //회전
+            int size = list.size();
+            int rotation = R % size;
+
+            r = layer;
+            c = layer;
+            int index = 0;
+            for (int d = 0; d < 4; d++) {
+                int len = (d % 2 == 0) ? width - 1 : height - 1;
+                for (int k = 0; k < len; k++) {
+                    map[r][c] = list.get((index + rotation) % size);
+                    r += dr[d];
+                    c += dc[d];
+                    index++;
+                }
+            }
+        }
+
+        StringBuilder sb = new StringBuilder();
+        for (int i = 0; i < N; i++) {
+            for (int j = 0; j < M; j++) {
+                sb.append(map[i][j]).append(" ");
+            }
+            sb.append("\n");
+        }
+        System.out.print(sb);
+    }
+}
+```