import sys
sys.setrecursionlimit(15000)
# a = int(input())
#
# def fet(num):
# if num == 1:
# return 1
# else:
# return num * fet(num-1)
#
# print(fet(a))
# a = int(input())
# def fibo(n):
# if n <= 2:
# return 1
#
# return fibo(n - 1) + fibo(n - 2)
#
# print(fibo(a))
# a = int(input())
# li = [0]*15000
#
# def fibo(n):
# if n <= 2:
# li[n] = 1
# return li[n]
#
# if li[n] != 0:
# return li[n]%10009
#
# li[n] = (fibo(n-1)%10009 + fibo(n-2)%10009)%10009
# return li[n]
#
# print(fibo(a))
# a = int(input())
#
# def triangle(b):
# if b == 0:
# return 1
#
# triangle(b-1)
# print("*" * b)
#
# triangle(a)
'''
a, b = map(int, input().split())
li = [0]*15000
# def paskal(n):
# if n <= 2:
# li[n] = 1
# return li[n]
#
# if li[n] != 0:
# return li[n]%10009
#
# li[n] = paskal(n-1) + paskal(n-2)
# return li[n]
'''
a, b = map(int, input().split())
data = []
for i in range(60):
v = [0]*60
data.append(v)
def paskal(x, y):
if x==0 and y==0:
return 1
data[x][0] = 1
data[0][y] = 1
return paskal(x-1, y-1)
paskal(a, b)
print(data[a][b])
top of page
실제 작동 상태를 확인하려면 라이브 사이트로 이동하세요.
210817
210817
댓글 0개
좋아요
댓글(0)
bottom of page