[20251031] BOJ / G5 / 다이어트 / 이종환 suOCKER

Author: Seol-JY

Seol-JY/202511/04 BO G5 배열 돌리기 3.md

@@ -0,0 +1,176 @@
+```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());
+            }
+        }
+        
+        st = new StringTokenizer(br.readLine());
+        for (int i = 0; i < R; i++) {
+            int op = Integer.parseInt(st.nextToken());
+            arr = operation(arr, op);
+        }
+        
+        StringBuilder sb = new StringBuilder();
+        for (int i = 0; i < arr.length; i++) {
+            for (int j = 0; j < arr[0].length; j++) {
+                sb.append(arr[i][j]).append(" ");
+            }
+            sb.append("\n");
+        }
+        System.out.print(sb);
+    }
+    
+    static int[][] operation(int[][] array, int op) {
+        switch (op) {
+            case 1: return op1(array);
+            case 2: return op2(array);
+            case 3: return op3(array);
+            case 4: return op4(array);
+            case 5: return op5(array);
+            case 6: return op6(array);
+            default: return array;
+        }
+    }
+    
+    static int[][] op1(int[][] array) {
+        int rows = array.length;
+        int cols = array[0].length;
+        int[][] result = new int[rows][cols];
+        
+        for (int i = 0; i < rows; i++) {
+            for (int j = 0; j < cols; j++) {
+                result[i][j] = array[rows - 1 - i][j];
+            }
+        }
+        return result;
+    }
+    
+    static int[][] op2(int[][] array) {
+        int rows = array.length;
+        int cols = array[0].length;
+        int[][] result = new int[rows][cols];
+        
+        for (int i = 0; i < rows; i++) {
+            for (int j = 0; j < cols; j++) {
+                result[i][j] = array[i][cols - 1 - j];
+            }
+        }
+        return result;
+    }
+    
+    static int[][] op3(int[][] array) {
+        int rows = array.length;
+        int cols = array[0].length;
+        int[][] result = new int[cols][rows];
+        
+        for (int i = 0; i < rows; i++) {
+            for (int j = 0; j < cols; j++) {
+                result[j][rows - 1 - i] = array[i][j];
+            }
+        }
+        return result;
+    }
+    
+    static int[][] op4(int[][] array) {
+        int rows = array.length;
+        int cols = array[0].length;
+        int[][] result = new int[cols][rows];
+        
+        for (int i = 0; i < rows; i++) {
+            for (int j = 0; j < cols; j++) {
+                result[cols - 1 - j][i] = array[i][j];
+            }
+        }
+        return result;
+    }
+    
+    static int[][] op5(int[][] array) {
+        int rows = array.length;
+        int cols = array[0].length;
+        int[][] result = new int[rows][cols];
+        
+        int halfR = rows / 2;
+        int halfC = cols / 2;
+        
+        for (int i = 0; i < halfR; i++) {
+            for (int j = 0; j < halfC; j++) {
+                result[i][j + halfC] = array[i][j];
+            }
+        }
+        
+        for (int i = 0; i < halfR; i++) {
+            for (int j = halfC; j < cols; j++) {
+                result[i + halfR][j] = array[i][j];
+            }
+        }
+        
+        for (int i = halfR; i < rows; i++) {
+            for (int j = halfC; j < cols; j++) {
+                result[i][j - halfC] = array[i][j];
+            }
+        }
+        
+        for (int i = halfR; i < rows; i++) {
+            for (int j = 0; j < halfC; j++) {
+                result[i - halfR][j] = array[i][j];
+            }
+        }
+        
+        return result;
+    }
+    
+    static int[][] op6(int[][] array) {
+        int rows = array.length;
+        int cols = array[0].length;
+        int[][] result = new int[rows][cols];
+        
+        int halfR = rows / 2;
+        int halfC = cols / 2;
+        
+        for (int i = 0; i < halfR; i++) {
+            for (int j = 0; j < halfC; j++) {
+                result[i + halfR][j] = array[i][j];
+            }
+        }
+        
+        for (int i = 0; i < halfR; i++) {
+            for (int j = halfC; j < cols; j++) {
+                result[i][j - halfC] = array[i][j];
+            }
+        }
+        
+        for (int i = halfR; i < rows; i++) {
+            for (int j = halfC; j < cols; j++) {
+                result[i - halfR][j] = array[i][j];
+            }
+        }
+        
+        for (int i = halfR; i < rows; i++) {
+            for (int j = 0; j < halfC; j++) {
+                result[i][j + halfC] = array[i][j];
+            }
+        }
+        
+        return result;
+    }
+}
+```