백준2338 [백준/파이썬] 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. [백준/파이썬] 24376번 РЕДИЦА -Codex, n = map(int, input().split())num, res = 1, ""while len(res) 2024. 7. 30. [백준/파이썬] 31995번 게임말 올려놓기 -Coden = int(input()) - 1m = int(input()) - 1print(n * m * 2) 2024. 7. 29. [백준/파이썬] 29070번 Ремонт от BB-8 -Codefrom math import ceila, b, h, w = map(int, input().split())print(ceil(h / a) * ceil(w / b)) 2024. 7. 28. [백준/파이썬] 26714번 Liczenie punktów -Coden = int(input())test = input()res = 0for i in range(0, n, n // 10): if not test[i:i + n // 10].count('N'): res += 1print(res) 2024. 7. 27. [백준/파이썬] 30775번 Рассадка -Codefrom math import ceiln, k = map(int, input().split())n_list = list(map(int, input().split()))print(ceil(sum(n_list) / n)) 2024. 7. 26. 이전 1 ··· 28 29 30 31 32 33 34 ··· 390 다음
