题解 | 牛牛的Ackmann
牛牛的Ackmann
https://www.nowcoder.com/practice/3a7a4c26420c4358a1a5cda3da2fa1c8
from sys import setrecursionlimit
setrecursionlimit(1000000)
def ackmann(m,n):
if m == 0:
return n+1
if m>0 and n == 0:
return ackmann(m-1,1)
if m > 0 and n > 0:
return ackmann(m-1,ackmann(m,n-1))
x,y = map(int,input().split())
print(ackmann(y,x))
