개발자 도비

n = int(input()) lines = [] for _ in range(n): lines.append(list(map(int, input().split()))) lines = sorted(lines, key=lambda x: x[0]) # LIS result = [[] for _ in range(n)] for i in range(n): if i == 0: result[i].append(lines[i][1]) else: for j in range(0, i): if result[j][-1] < lines[i][1]: if len(result[i]) - 1 < len(result[j]): result[i] = result[j] + [lines[i][1]] if not result[i]: result[i]..

n = int(input()) nums = list(map(int, input().split())) sum = 0 max = nums[0] for num in nums: sum += num if sum > 0: if max 0: if max < sum: max = sum else: if max < num: max = num else: sum = 0 print(m..

n = int(input()) rgb = [] for _ in range(n): rgb.append(list(map(int, input().split()))) for i in range(1, len(rgb)): rgb[i][0] = min(rgb[i-1][1], rgb[i-1][2]) + rgb[i][0] rgb[i][1] = min(rgb[i-1][0], rgb[i-1][2]) + rgb[i][1] rgb[i][2] = min(rgb[i-1][0], rgb[i-1][1]) + rgb[i][2] print(min(rgb[n-1][0], rgb[n-1][1], rgb[n-1][2]))

t = int(input()) def tri_cnt(n): cnt = [1,1,1] if n == 0 or n == 1 or n == 2: return 1 else: for i in range(3, n+1): cnt.append(cnt[i-3] + cnt[i-2]) return cnt[n] for _ in range(t): n = int(input()) print(tri_cnt(n-1))

cnt0 = [1, 0] cnt1 = [0, 1] def fibo(n): length = len(cnt0) if length

n = int(input()) f0, f1 = 0, 1 for i in range(n): f0, f1 = f1, f0+f1 print(f0) # 스왑 표현