Ackermann函数的递归与非递归算法

//折腾了我将近一周了，没查到能实际应用的程序代码只好自己魔改
#ifndef PCH_H
#define PCH_H
/*
科普:阿克曼函数
Ackermann(0,n)=n+1
Ackermann(1,n)=n+2
Ackermann(2,n)=2*n+3
Ackermann(3,n)=2^(n+3)-3
*/
#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<malloc.h>
#include<math.h>
constexpr auto MAXSIZE = 100;
constexpr auto ERROR = 0;
constexpr auto OK = 1;
constexpr auto M= 2;
constexpr auto N= 3;
typedef int Status;
typedef struct
{
   
    int m;
    int n;

}ElemType;
typedef struct
{
   
    ElemType *base;//栈底
    ElemType *top;//栈顶
    int stacksize;
}SqStack;
Status InitStack(SqStack &S);
int Ackermann_Re(int m, int n