# # 1930 supersum question cant be done but I tried to solve it lmao
# list = []
# while True:
# a, b = map(int, input().split())
# if a == '' and b == '':
# break
# else:
# list.append([a, b])
#
# def supersum(a, b):
# if a == 0 and b == b:
# return b
# else:
# return supersum(a - 1, b + 1)
#
# print(supersum(a, b))
# # 1915
# list = [0] * 201
#
# def pivo(n):
# global list
# if n < 0:
# return 0
# if n == 0:
# return 1
# if n == 1:
# return 1
# if list[n] != 0:
# return list[n]
# list[n] = pivo(n-1) + pivo(n-2)
# return list[n]
#
# n = int(input())
# print(pivo(n-1))
# # 6098 just a short redo
# square = []
# a = 1
# b = 1
#
# for i in range(10):
# row = list(map(int, input().split()))
# square.append(row)
#
# square[a][b] = 9
#
# while True:
# if square[a][b+1] == 2:
# b += 1
# square[a][b] = 9
# break
# elif square[a][b+1] == 1:
# if square[a+1][b] == 1:
# break
# elif square[a+1][b] == 2:
# a += 1
# square[a][b] = 9
# break
# else:
# a += 1
# square[a][b] = 9
# else:
# b += 1
# square[a][b] = 9
#
#
# for i in range(10):
# for j in range(10):
# print(square[i][j], end=' ')
# print()
# 4564 unfinished
import sys
sys.setrecursionlimit(10**7)
n = int(input())
yay = []
three = 0
for i in range(n):
points = int(input())
yay.append(points)
def stairs(n):
global yay
global three
if n > len(yay):
return 0
if n+1 == len(yay):
return yay(n+1)
print(stairs(n))
# have to find a way to use recursion like stairs(n+1) + stairs(n+2)
# while also finding a way to not go up 3 stairs in a row
# so the adding should not be in one place, it should be separate
# -> maybe use if문 to separate the adding process
# use memoisation when 값 더할때 (like per step)
# have to compare numbers at the end
# similar to pivonachi 수열!?! (except some parts are reversed idk)
top of page
실제 작동 상태를 확인하려면 라이브 사이트로 이동하세요.
20240818
20240818
댓글 0개
좋아요
댓글(0)
bottom of page