# n = 0
# c = 0
# e = 0
# a, b = input().split()
# x, y, z = input().split()
# d = []
# for i in range(a):
# v = input().split()
# for j in range(b):
# v[j] = int(v[j])
# k = int(input())
#
# for l in range(k):
#
# for i in range(a):
#
# for j in range(b):
# if d[i][j] == 0:
# for q in range(i-1, i+2):
# for p in range(j-1, j+2):
# #if q>=0 and p>0 and p<a and q<b:
# if d[q][p] == 1:
# c += 1
# else:
# for q in range(i-1, i+2):
# for p in range(j - 1, j + 2):
# if d[q][p] == 1:
# e += 1
# w, h = input().split()
# w = int(w)
# h = int(h)
# n = int(input())
#
# da=[]
# for i in range(w+1):
# v = []
# for j in range(h+1):
# v.append(0)
# da.append(v)
#
# for i in range(n):
# l, d, x, y = input().split()
# l = int(l)
# d = int(d)
# x = int(x)-1
# y = int(y)-1
# if d==0:
# for j in range(l):
# da[x][y+j] = 1
# else:
# for k in range(l):
# da[x+k][y] = 1
#
# for i in range(w):
# for j in range(h):
# print(da[i][j],end=' ')
# print()
# def simple(x, y):
# print('Hello world')
# return x+y
#
# print(simple(10, 20))
# def simple(x, y):
# return x+y
#
# print(simple(10, 'Hello'))
a = 0
gap = 0
def s(n):
d = [0] * 100005
d[1] = 1
d[2] = 1
# data = []
# for i in range(n):
# data.append(1)
for i in range(3,n+1):
gap = d[i-1]
gFront = d[gap]
gBack = d[i-gap]
d[i] = gFront + gBack
return d[n]
n = int(input())
print(s(n))
top of page
실제 작동 상태를 확인하려면 라이브 사이트로 이동하세요.
230218
230218
댓글 0개
좋아요
댓글(0)
bottom of page