题解 | 牛牛的Ackmann
牛牛的Ackmann
https://www.nowcoder.com/practice/3a7a4c26420c4358a1a5cda3da2fa1c8
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int ack(int m,int n){
if(m == 0) return n+1;
else if(m > 0 && n == 0){
return ack(m-1,1);
}
else if(m > 0 && n > 0){
return ack(m-1,ack(m,n-1));
}
return -1;
}
int main(){
int n,m; cin >> n >> m;
cout << ack(m,n);
return 0;
}
查看15道真题和解析