2021-08-13

最新推荐文章于 2021-11-17 11:36:58 发布

原创最新推荐文章于 2021-11-17 11:36:58 发布 · 167 阅读

0 ·

CC 4.0 BY-SA版权

如果您想转载我的文章的话，请附上我的网址和博客名，谢谢。

HDU 专栏收录该内容

4 篇文章

订阅专栏

该博客介绍了如何计算 Ackermann 函数的值，这是一个在理论计算机科学中重要的递归函数。博主给出了一个 C++ 代码实现，用于计算给定 m 和 n 的 Ackermann 函数值，其中 m 的范围限制在 0 到 3 之间，n 的取值根据 m 的大小有所不同。题目要求读者解决这个问题，并给出了样例输入和输出。博主承诺，成功解决此问题的读者将有机会获得邀请共进晚餐。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Eddy’s research II

*Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 6933 Accepted Submission(s): 2469
*

Problem Description

As is known, Ackermann function plays an important role in the sphere of theoretical computer science. However, in the other hand, the dramatic fast increasing pace of the function caused the value of Ackermann function hard to calcuate.

Ackermann function can be defined recursively as follows:

Now Eddy Gives you two numbers: m and n, your task is to compute the value of A(m,n) .This is so easy problem,If you slove this problem,you will receive a prize(Eddy will invite you to hdu restaurant to have supper).

Input

Each line of the input will have two integers, namely m, n, where 0 < m < =3.
Note that when m<3, n can be any integer less than 1000000, while m=3, the value of n is restricted within 24.
Input is terminated by end of file.

Output

For each value of m,n, print out the value of A(m,n).

Sample Input

1 3
2 4

Sample Output

5
11

Author

eddy

代码

#include <iostream>
#include <cstdio>
using namespace  std;

long long slv(int m, int n)
{
    if(m == 1)
    {
        return n  + 2;
    }
    if(m == 2)
    {
        return 2 * n +3;
    }
    if(m==3 && n  == 0)
    {
        return  5;
    }
    if(m ==3 && n)
    {
        return 2 * slv(3,  n- 1)+ 3 ;
    }
    if(m == 0)
    {
        return n  + 1;
    }
    throw;
}

int  main()
{
    int n , m;
    while(scanf("%d%d",  &m,&n)  == 2 )
    {
        printf("%lld\n", slv(m, n));
    }
    return 0;
}