본문 바로가기

파이썬2210

[백준/파이썬] 20490번 Relocation -Coden, q = map(int, input().split())company_point = [0] + list(map(int, input().split()))for _ in range(q): a, c, x = map(int, input().split()) if a == 1: company_point[c] = x else: print(abs(company_point[c] - company_point[x])) 2025. 3. 3.
[백준/파이썬] 20490번 Рыцарский щит -Codea_list = list(map(int, input().split()))b_list = list(map(int, input().split()))print(sum(a_list + b_list) - 2 * min(max(a_list), max(b_list))) 2025. 3. 2.
[백준/파이썬] 33538번 Crawling -Codel = int(input())n = int(input())t = float(input())flag = Falsefor _ in range(n): f, b = map(float, input().split()) time = l / f + l / b if t > time: flag = Trueprint("HOPE" if flag else "DOOMED") 2025. 3. 1.
[백준/파이썬] 6491번 Perfection -Codeimport sysdef solution(n): answer = [] for i in range(1, n): if n % i == 0: answer.append(i) return answernums = list(map(int, sys.stdin.read().split()))for num in nums: if num == 0: break sum_list = sum(solution(num)) if sum_list == num: res = "PERFECT" elif sum_list sqrt를 사용하는 방법을 해봤지만 해결이 안 돼서 완전 탐색 방법으로 바꾸어서 풀었습니다. 2025. 2. 28.
[백준/파이썬] 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.

티스토리툴바