From 641042a55dc65bf3ca2007aa99c4b8737dd72b77 Mon Sep 17 00:00:00 2001 From: skdudddl Date: Tue, 16 Jan 2024 21:01:05 +0900 Subject: [PATCH 1/2] Create 1940.java --- nayeongkim/SWEA/D2/1954.java | 48 ++++++++++++++++++++++++++++++++++++ 1 file changed, 48 insertions(+) create mode 100644 nayeongkim/SWEA/D2/1954.java diff --git a/nayeongkim/SWEA/D2/1954.java b/nayeongkim/SWEA/D2/1954.java new file mode 100644 index 00000000..d37f483c --- /dev/null +++ b/nayeongkim/SWEA/D2/1954.java @@ -0,0 +1,48 @@ +import java.util.Scanner; +import java.io.FileInputStream; + +/* + 사용하는 클래스명이 Solution 이어야 하므로, 가급적 Solution.java 를 사용할 것을 권장합니다. + 이러한 상황에서도 동일하게 java Solution 명령으로 프로그램을 수행해볼 수 있습니다. + */ +class Solution4 { + public static void main(String args[]) throws Exception { + + Scanner sc = new Scanner(System.in); + int T; + T = sc.nextInt(); + int[] dx = {0, 1, 0, -1}; + int[] dy = {1, 0, -1, 0}; + + for (int test_case = 1; test_case <= T; test_case++) { + int N = sc.nextInt(); + int[][] arr = new int[N][N]; + int cnt = 1; + int x = 0; + int y = -1; + int d = 0; + while (cnt <= N * N) { + int nx = x + dx[d]; + int ny = y + dy[d]; + if (nx >= 0 && nx < N && ny >= 0 && ny < N && arr[nx][ny] == 0) { + arr[nx][ny] = cnt++; + x = nx; + y = ny; + } else { + d = (d + 1) % 4; + + } + + } + System.out.println("#"+test_case); + for(int i = 0; i Date: Tue, 16 Jan 2024 21:20:55 +0900 Subject: [PATCH 2/2] Create 1940.java --- nayeongkim/SWEA/D2/1961.java | 57 ++++++++++++++++++++++++++++++++++++ 1 file changed, 57 insertions(+) create mode 100644 nayeongkim/SWEA/D2/1961.java diff --git a/nayeongkim/SWEA/D2/1961.java b/nayeongkim/SWEA/D2/1961.java new file mode 100644 index 00000000..45f2f091 --- /dev/null +++ b/nayeongkim/SWEA/D2/1961.java @@ -0,0 +1,57 @@ +import java.util.Scanner; +import java.io.FileInputStream; + +/* + 사용하는 클래스명이 Solution 이어야 하므로, 가급적 Solution.java 를 사용할 것을 권장합니다. + 이러한 상황에서도 동일하게 java Solution 명령으로 프로그램을 수행해볼 수 있습니다. + */ +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[][] arr90 = new int[N][N]; + int[][] arr180 = new int[N][N]; + int[][] arr270 = new int[N][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++) { + for (int j = 0; j < N; j++) { + arr90[i][j] = arr[N-1-j][i]; + } + } + for (int i = 0; i < N; i++) { + for (int j = 0; j < N; j++) { + arr180[i][j] = arr90[N-1-j][i]; + } + } + for (int i = 0; i < N; i++) { + for (int j = 0; j < N; j++) { + arr270[i][j] = arr180[N-1-j][i]; + } + } + for (int i = 0; i < N; i++) { + for(int j=0;j