백준2300 [백준/파이썬] 32902번 Chips -Codek, n = map(int, input().split())print(n + 1, n * k + 1) 2024. 12. 3. [백준/파이썬] 32775번 가희와 4시간의 벽 1 -Codes = int(input())f = int(input())print("flight" if s > f else "high speed rail") 2024. 12. 1. [백준/파이썬] 6929번 Dressing Up -Coden = int(input())res = []for i in range(1, n, 2): res.append("*" * i + " " * ((n - i) * 2) + "*" * i)for el in res: print(el)print("*" * n * 2)for el in res[::-1]: print(el) 2024. 11. 30. [백준/파이썬] 32801번 Generalized FizzBuzz -Codefrom math import lcmn, a, b = map(int, input().split())ab_lcm = lcm(a, b)fizzbuzz = n // ab_lcmfizz = n // a - fizzbuzzbuzz = n // b - fizzbuzzprint(fizz, buzz, fizzbuzz) 2024. 11. 29. [백준/파이썬] 18154번 Speeding -Coden = int(input())picture = [list(map(int, input().split())) for _ in range(n)]res = 0for i in range(1, n): res = max( res, (picture[i][1] - picture[i - 1][1]) // (picture[i][0] - picture[i - 1][0]) )print(res) 2024. 11. 28. [백준/파이썬] 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. 이전 1 2 3 4 5 6 7 ··· 384 다음
