파이썬2206 [백준/파이썬] 5566번 Штурм -Codedy = [0, -1, 0, 1]dx = [-1, 0, 1, 0]n, m = map(int, input().split())cell = [list(map(int, input().split())) for _ in range(n)]answer= 0for i in range(0, n): for j in range(0, m): flag = True for k in range(0, 4): y = i + dy[k] x = j + dx[k] if 0 = cell[i][j]: flag = False break if flag: .. 2025. 2. 27. [백준/파이썬] 5566번 주사위 게임 -Coden, m = map(int, input().split())order_list = [int(input()) for _ in range(n)]position = 1for i in range(1, m + 1): position += int(input()) if position >= n: print(i) break position += order_list[position - 1] if position >= n: print(i) break 2025. 2. 26. [백준/파이썬] 33541번 2025는 무엇이 특별할까? -Coden = int(input())for i in range(n + 1, 10000): num1 = int(str(i)[:2]) num2 = int(str(i)[2:]) if (num1 + num2) ** 2 == i: print(i) breakelse: print(-1) 2025. 2. 25. [백준/파이썬] 33151번 노트북 세 대를 가지고 왔다 -Codeprint(min(map(int, input().split()))) 2025. 2. 24. [백준/파이썬] 3554번 Enigmatic Device -Codedef rangeSum(list, strat, end): return sum(list[strat - 1: end])def rangePow(list, start, end): for i in range(start - 1, end): list[i] = (list[i] ** 2 % 2010) return listn = int(input())a_list = list(map(int, input().split()))for _ in range(int(input())): k, l, r = map(int, input().split()) if k == 1: a_list = rangePow(a_list, l, r) else: print(rangeS.. 2025. 2. 23. [백준/파이썬] 24349번 МЕД -Coden, a, b, c = map(int, input().split())if n == 1: res = 0elif min(a, b, c) != c: res = min(a, b) * (n - 1)else: res = min(a, b) + c * (n - 2)print(res // 100, res % 100) 2025. 2. 22. 이전 1 2 3 4 ··· 368 다음