[D2] Title: 달팽이 숫자, Time: 63 ms, Memory: 52,480 KB -BaekjoonHub

Author: wlsgur11

SWEA/D2/1954. 달팽이 숫자/README.md

@@ -0,0 +1,15 @@
+# [D2] 달팽이 숫자 - 1954 
+
+[문제 링크](https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5PobmqAPoDFAUq) 
+
+### 성능 요약
+
+메모리: 52,480 KB, 시간: 63 ms, 코드길이: 621 Bytes
+
+### 제출 일자
+
+2025-05-12 07:54
+
+
+
+> 출처: SW Expert Academy, https://swexpertacademy.com/main/code/problem/problemList.do

SWEA/D2/1954. 달팽이 숫자/달팽이 숫자.py

@@ -0,0 +1,28 @@
+T = int(input())
+
+for t in range(1, T+1):
+    N = int(input())
+    snail = [[0] * N for _ in range(N)]
+    
+    dx = [0, 1, 0, -1]
+    dy = [1, 0, -1, 0]
+    
+    x, y = 0, 0
+    direction = 0
+    
+    for num in range(1, N*N + 1):
+        snail[x][y] = num
+        
+        nx = x + dx[direction]
+        ny = y + dy[direction]
+        
+        if nx < 0 or nx >= N or ny < 0 or ny >= N or snail[nx][ny] != 0:
+            direction = (direction + 1) % 4
+            nx = x + dx[direction]
+            ny = y + dy[direction]
+        
+        x, y = nx, ny
+    
+    print(f"#{t}")
+    for row in snail:
+        print(*row)