题解 | #牛牛的Ackmann#
牛牛的Ackmann
https://www.nowcoder.com/practice/3a7a4c26420c4358a1a5cda3da2fa1c8
#include <stdio.h> int vAckmann(int m,int n) { if(m==0) return n+1; else if(m>0&&n==0) return vAckmann(m-1,1); else if(m>0&&n>0) return vAckmann(m-1,(vAckmann(m,n-1))); return 0; } int main() { int n,m; scanf("%d%d",&n,&m); printf("%d",vAckmann(m,n)); return 0; }