[구름톤 챌린지] Day13 : 발전기(2)
입력 및 출력 소스 코드 from collections import deque n, k = map(int, input().split()) a = [list(map(int, input().split())) for _ in range(n)] visited = [[False for _ in range(n)] for _ in range(n)] danzi = [0 for _ in range(31)] dydx = [(1, 0), (0, 1), (-1, 0), (0, -1)] for i in range(n): for j in range(n): if not visited[i][j]: num = a[i][j] q = deque([(i, j)]) visited[i][j] = True count = 1 checked = F..
2023. 9. 1.
[구름톤 챌린지] Day10 : GameJam
입력 및 출력 소스 코드 from collections import deque def move(y, x, d, num): dy, dx = 0, 0 if d == 'D': dy, dx = 1, 0 elif d == 'U': dy, dx = -1, 0 elif d == 'R': dy, dx = 0, 1 elif d == 'L': dy, dx = 0, -1 moved = 0 while moved = n: y -= n if x = n: x -= n if visited[y][x]: return moved, -1, -1 else: visited[y][x] = True moved += 1 ret ..
2023. 8. 27.
[구름톤 챌린지] Day9 : 폭탄 구현하기(2)
입력 및 출력 소스 코드 n, k = map(int, input().split()) a = [input().strip().split() for _ in range(n)] bomb = [tuple(map(int, input().split())) for _ in range(k)] ground = [[0 for _ in range(n)] for _ in range(n)] dydx = [(1, 0), (0, 1), (-1, 0), (0, -1)] for y, x in bomb: y -= 1 x -= 1 if a[y][x] == '0': ground[y][x] += 1 elif a[y][x] == '@': ground[y][x] += 2 for dy, dx in dydx: ny, nx = y + dy, x + d..
2023. 8. 27.
