HDU - 1165 - Eddy's research II

先上题目：

Eddy's research II

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

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

 

　　题意：根据给定的递推式求A(m,n)，看起来没什么难度，但是一开始用打表的方法一直WA，期间也发现了每一行(每一个m为一行)有规律，比较容易看出来的是第零行和第一行，然后第二行的规律是n*2+3，第三行需要是a[i]=a[i-1]*2+3;

 

上代码：

 

#include <cstdio>
#include <cstring>
#define MAX 1000002
#define LL long long
using namespace std;

LL a[MAX];

void deal(){
    int n;
    memset(a,0,sizeof(a));
    n=MAX-2;
    a[0]=5;
    for(int i=1;i<=n;i++){
        a[i]=2*a[i-1]+3;
    }

}

int main()
{
    int n,m;
    //freopen("data.txt","r",stdin);
    deal();
    while(scanf("%d %d",&m,&n)!=EOF){
        if(m==0) printf("%d\n",n+1);
        else if(m==1) printf("%d\n",n+2);
        else if(m==2) printf("%d\n",n*2+3);
        else printf("%I64d\n",a[n]);
    }
    return 0;
}