Eddy's research II

最新推荐文章于 2026-04-24 16:40:03 发布

原创最新推荐文章于 2026-04-24 16:40:03 发布 · 228 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

动态规划专栏收录该内容

15 篇文章

订阅专栏

本文介绍了一个简单的Ackermann函数计算方法，该函数在理论计算机科学中扮演重要角色。文章提供了递归定义的Ackermann函数及其计算实例，对于m小于等于3的情况给出了具体的实现代码。

Eddy's research II

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5247 Accepted Submission(s): 1928

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

Recommend

JGShining

思路：就是找规律，很简单

代码：

#include<stack>
#include<queue>
#include<math.h>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define max(a,b)a>b?a:b
#define min(a,b)a>b?b:a
int dp[1010][1010]={0};

int f(int x,int y)
{
    int i,j;
    if(x==0)
    {
        return y+1;
    }
    if(x==1)
    {
        return 2+y;
    }
    if(x==2)
        return 3+2*y;
    if(x==3)
    {
        if(y>0)
            return f(2,f(x,y-1));
        if(y==0)
            return f(2,1);
    }
}
int main()
{
   int m,n;
    while(scanf("%d%d",&m,&n)!=EOF)
    {
        int ans=0;
        ans=f(m,n);
        printf("%d\n",ans);
    }
    return 0;
}