From 0d5a3b4791c03e647937a36e30dd2f6b7d6d1954 Mon Sep 17 00:00:00 2001
From: JHLEE325 <82587652+JHLEE325@users.noreply.github.com>
Date: Wed, 8 Oct 2025 01:33:00 +0900
Subject: [PATCH] =?UTF-8?q?[20251008]=20BOJ=20/=20G5=20/=20=EB=B0=B0?=
 =?UTF-8?q?=EC=97=B4=20=EB=8F=8C=EB=A6=AC=EA=B8=B0=201=20/=20=EC=9D=B4?=
 =?UTF-8?q?=EC=A4=80=ED=9D=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...\353\217\214\353\246\254\352\270\260 1.md" | 66 +++++++++++++++++++
 1 file changed, 66 insertions(+)
 create mode 100644 "JHLEE325/202510/08 BOJ G5 \353\260\260\354\227\264 \353\217\214\353\246\254\352\270\260 1.md"

diff --git "a/JHLEE325/202510/08 BOJ G5 \353\260\260\354\227\264 \353\217\214\353\246\254\352\270\260 1.md" "b/JHLEE325/202510/08 BOJ G5 \353\260\260\354\227\264 \353\217\214\353\246\254\352\270\260 1.md"
new file mode 100644
index 00000000..e496c204
--- /dev/null
+++ "b/JHLEE325/202510/08 BOJ G5 \353\260\260\354\227\264 \353\217\214\353\246\254\352\270\260 1.md"	
@@ -0,0 +1,66 @@
+```java
+import java.io.*;
+import java.util.*;
+
+public class Main {
+
+    static int n, m, r;
+    static int[][] arr;
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+
+        n = Integer.parseInt(st.nextToken());
+        m = Integer.parseInt(st.nextToken());
+        r = Integer.parseInt(st.nextToken());
+
+        arr = new int[n][m];
+
+        for (int i = 0; i < n; i++) {
+            st = new StringTokenizer(br.readLine());
+            for (int j = 0; j < m; j++) {
+                arr[i][j] = Integer.parseInt(st.nextToken());
+            }
+        }
+
+        rotate();
+
+        for (int i = 0; i < n; i++) {
+            for (int j = 0; j < m; j++) {
+                System.out.print(arr[i][j]+" ");
+            }
+            System.out.println();
+        }
+    }
+
+    static void rotate() {
+        int layers = Math.min(n, m) / 2;
+
+        for (int layer = 0; layer < layers; layer++) {
+            int top = layer;
+            int left = layer;
+            int bottom = n - 1 - layer;
+            int right = m - 1 - layer;
+
+            for (int i = 0; i < r; i++) {
+                int temp = arr[top][left];
+
+                for (int j = left; j < right; j++)
+                    arr[top][j] = arr[top][j + 1];
+
+                for (int j = top; j < bottom; j++)
+                    arr[j][right] = arr[j + 1][right];
+
+                for (int j = right; j > left; j--)
+                    arr[bottom][j] = arr[bottom][j - 1];
+
+                for (int j = bottom; j > top + 1; j--)
+                    arr[j][left] = arr[j - 1][left];
+
+                arr[top + 1][left] = temp;
+            }
+        }
+    }
+}
+```