From 04b635449aec43ce24ecec2093ea693830d7e7ce Mon Sep 17 00:00:00 2001
From: GeonHui2 <022686@naver.com>
Date: Sat, 13 Jan 2024 21:13:34 +0900
Subject: [PATCH] Create 1961.java

---
 .../SWexpertacademy/D2/1961.java"             | 64 +++++++++++++++++++
 1 file changed, 64 insertions(+)
 create mode 100644 "\354\235\264\352\261\264\355\235\254/SWexpertacademy/D2/1961.java"

diff --git "a/\354\235\264\352\261\264\355\235\254/SWexpertacademy/D2/1961.java" "b/\354\235\264\352\261\264\355\235\254/SWexpertacademy/D2/1961.java"
new file mode 100644
index 00000000..479d031f
--- /dev/null
+++ "b/\354\235\264\352\261\264\355\235\254/SWexpertacademy/D2/1961.java"
@@ -0,0 +1,64 @@
+import java.util.Scanner;
+import java.io.FileInputStream;
+
+class Solution
+{
+	public static void main(String args[]) throws Exception
+	{
+		Scanner sc = new Scanner(System.in);
+		int T;
+		T=sc.nextInt();
+        
+		for(int test_case = 1; test_case <= T; test_case++)
+		{
+            int N = sc.nextInt();
+            int[][] arr = new int[N][N];
+            int[][][] result = new int[N][3][N];
+            
+            for (int i = 0; i < N; i++) {
+                for (int j = 0; j < N; j++) {
+                    arr[i][j] = sc.nextInt();
+                }
+            }
+            
+            for (int i = 0; i < N; i++) {
+                int[] box = new int[N];
+                
+                for (int j = N - 1; 0 <= j; j--) {
+                    box[N - j - 1] = arr[j][i];
+                }
+                result[i][0] = box;
+            }
+            
+            for (int i = N - 1; 0 <= i; i--) {
+                int[] box = new int[N];
+                
+                for (int j = N - 1; 0 <= j; j--) {
+                    box[N - j - 1] = arr[i][j];
+                }
+                result[N - i - 1][1] = box;
+            }
+            
+            for (int i = N - 1; 0 <= i; i--) {
+                int[] box = new int[N];
+                
+                for (int j = 0; j < N; j++) {
+                    box[j] = arr[j][i];
+                }
+                result[N - i - 1][2] = box;
+            }
+            
+            System.out.printf("#%d\n", test_case);
+            
+            for (int i = 0; i < N; i++) {
+                for (int j = 0; j < 3; j++) {
+                    for (int k = 0; k < N; k++) {
+                        System.out.print(result[i][j][k]);
+                    }
+                    System.out.print(" ");
+                }
+                System.out.println();
+            }
+		}
+	}
+}