takeU

from collections import deque n, m = map(int, input().split()) board = [list(map(int, list(input()))) for _ in range(m)] visited = [[0] * n for _ in range(m)] visited[0][0] = 1 dx, dy = [-1, 1, 0, 0], [0, 0, -1, 1] q = deque([[0, 0, 0]]) while q: x, y, c = q.popleft() if x == m - 1 and y == n - 1: print(c) break for i in range(4): nx, ny = x + dx[i], y + dy[i] if 0

from collections import deque n, l, r = map(int, input().split()) board = [list(map(int, input().split())) for _ in range(n)] dx, dy = [-1, 1, 0, 0], [0, 0, -1, 1] def bfs(x, y): q = deque([[x, y]]) li = [[x, y]] visited[x][y] = 1 while q: x, y = q.popleft() for i in range(4): nx, ny = x + dx[i], y + dy[i] if 0

n = int(input()) count = 0 def recursion(s, l, r): global count count += 1 if l >= r: return 1 elif s[l] != s[r]: return 0 else: return recursion(s, l + 1, r - 1) def isPalindrome(s): return recursion(s, 0, len(s) - 1) for _ in range(n): count = 0 print(isPalindrome(input()), count)

print("CY" if int(input()) % 5 in [0, 2] else "SK") 게임 이론

a, b = map(int, input().split()) def is_prime(x): for i in range(2, int(x ** 0.5) + 1): if x % i == 0: return False return True for i in range(a, b + 1): if i in [5, 7, 11]: print(i) elif len(str(i)) % 2 and str(i) == str(i)[::-1]: if is_prime(i): print(i) print(-1) 소수 판정

// 9658 print('SK' if [1, 0, 1, 0, 1, 1, 1][(int(input())) % 7] else 'CY') // 9660 print('SK' if [1, 0, 1, 1, 1, 1, 0][(int(input()) - 1) % 7] else 'CY')

n = int(input()) dp = [0] * 1001 dp[1] = dp[3] = dp[4] = 1 for i in range(5, n + 1): if not min(dp[i - 1], dp[i - 3], dp[i - 4]): dp[i] = 1 print('SK' if dp[n] else 'CY') dp, 게임이론

// 9655, 9659 print('SK' if int(input()) % 2 else 'CY') // 9656 print('CY' if int(input()) % 2 else 'SK') 게임이론

import sys input = sys.stdin.readline n = int(input()) li = sorted([tuple(map(int, input().split())) for _ in range(n)]) check = [list(li[0])] for i in range(1, n): if check[-1][1] >= li[i][0]: check[-1][1] = max(check[-1][1], li[i][1]) else: check.append(list(li[i])) ans = 0 for c in check: ans += c[1] - c[0] print(ans) 튜플이 리스트보다 속도가 빠름

from collections import deque n = int(input()) li = list(map(lambda x: 1 if x == 'O' else 0, input().split())) def win(li): return True if sum([li[2 * i] - li[2 * i + 1] for i in range(n)]) > 0 else False q = deque([[li, 0]]) while q: cur, count = q.popleft() if win(cur): print(count) break for i in range(count + 1, 2 * n): temp = [cur[i]] + cur[:i] + cur[i + 1:] q.append([temp, count + 1]) bfs,..