오블완21 [백준/파이썬] 22113번 창영이와 버스 -Coden, m = map(int, input().split())bus = list(map(int, input().split()))total_cost = [list(map(int, input().split())) for _ in range(n)]res = 0for i in range(m - 1): res += total_cost[bus[i] - 1][bus[i + 1] - 1]print(res) 2024. 11. 27. [백준/파이썬] 32710번 구구단표 -Coden = int(input())for i in range(2, 10): for j in range(1, 10): if n == i or n == j or n == i * j: print(1) exit()print(0) 2024. 11. 26. [백준/파이썬] 32364번 Hat Circle -Codefrom sys import stdininput = stdin.readlinen = int(input())hat = [int(input()) for _ in range(n)]res = 0for i in range(n): if hat[i] == hat[(n // 2 + i) % n]: res += 1print(res) 2024. 11. 25. [백준/파이썬] 32795번 Intuitive Elements -Codefor _ in range(int(input())): a = input() b = input() flag = True for w in b: if w not in a: flag = False break print("YES" if flag else "NO") 2024. 11. 24. [백준/파이썬] 32728번 Sõnakuulelik Tom -Codedef sol(arr, cnt, now, c): if len(res[now]) 2024. 11. 23. [백준/파이썬] 32661번 Airfare Grants -Codemax_res, min_res = 0, 1e9for _ in range(int(input())): p = int(input()) max_res = max(max_res, p) min_res = min(min_res, p)print(max(0, min_res - max_res // 2)) 2024. 11. 22. 이전 1 2 3 4 다음
