백준2319 [백준/파이썬] 12780번 원피스 -Codeh = input()n = input()print(h.count(n)) 2024. 8. 5. [백준/파이썬] 24197번 Tabbtabbande -Coden, m = map(int, input().split())position = list(map(int, input().split()))now, res = 1, 0for p in position: res += min((now - p + n) % n, (p - now + n) % n) now = pprint(res) 2024. 8. 4. [백준/파이썬] 23275번 Knot Knowledge -Coden = int(input())x_list = list(map(int, input().split()))y_list = list(map(int, input().split()))for x in x_list: if x not in y_list: print(x) break 2024. 8. 3. [백준/파이썬] 29097번 Короли -Codeli = list(map(int, input().split()))res = [li[i] * li[i + 3] for i in range(3)]names = ["Joffrey", "Robb", "Stannis"]for i in range(3): if max(res) == res[i]: print(names[i], end=" ") 2024. 8. 2. [백준/파이썬] 11880번 개미 -Codefrom sys import stdininput = stdin.readlinefor _ in range(int(input())): line = list(map(int, input().split())) res = [] for i in range(3): res.append(line[i] ** 2 + (sum(line) - line[i]) ** 2) print(min(res)) 2024. 8. 1. [백준/파이썬] 23397번 Kathmandu -Codet, d, m = map(int, input().split())now, res = 0, "N"for _ in range(m): y = int(input()) if y - now >= t: res = "Y" break now = yif d - now >= t: res = "Y"print(res) 2024. 7. 31. 이전 1 ··· 24 25 26 27 28 29 30 ··· 387 다음
