• 민제

n = int(input())
answer = [0] * 301
arr = [0]

for _ in range(n):
    arr.append(int(input()))

if n == 1:
    answer[1] = arr[1]
elif n == 2:
    answer[2] = arr[1] + arr[2]
if len(arr) > 3:
    answer[1] = arr[1]
    answer[2] = answer[1] + arr[2]
    answer[3] = max(arr[1] + arr[3], arr[2] + arr[3])
    for i in range(4, n + 1):
        answer[i] = max(answer[i - 3] + arr[i - 1] + arr[i], answer[i - 2] + arr[i])

print(answer[n])

• 정민

# 백준 2579번 계단 오르기 (실버3)

n = int(input())
list1 = []
for _ in range(n):
  list1.append(int(input()))

result = []
if len(list1) <= 2: 
    print(sum(list1))
else: 
  result = [list1[0], list1[0]+list1[1], (max(list1[0], list1[1]) + list1[2])]

  for i in range(3, n):
    result.append(max(result[i-3] + list1[i-1] + list1[i], result[i-2] + list1[i]))
    # 2계단 연속 뛰기 vs 1계단 건너 뛰기

  print(result[-1])

• 정환

import sys
input = sys.stdin.readline

n = int(input())
dp = [0]*1001
dp[1] = 1
dp[0] = 1

for i in range(2, n+1):
    dp[i] = dp[i-1] + 2*dp[i-2]
    
print(dp[n]%10007)