// Eddy 繼續
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
/********************
看到哦這個題的第一眼感覺像是遞推，然後根據那個題目中的公式發現不太好找，就先寫了一個遞歸，打表，然後，恩，找規律……
打表，這才是真正的打表啊……
看到這個表，規律就不用我說了吧……
*************************/
Code:<喎?http://www.Bkjia.com/kf/ware/vc/" target="_blank" class="keylink">vcD4KPHA+PHByZSBjbGFzcz0="brush:java;">#include
#include
#include
using namespace std;
int num[30];
int main()
{
int i,j,n,m;
num[0] = 5;
for(i = 1;i<30;i++)
num[i] = num[i-1]*2+3;
while(cin>>m>>n&&m&&n)
{
if(m==1)
printf("%d\n",n+2);
if(m==2)
printf("%d\n",2*n+3);
if(m==3)
printf("%d\n",num[n]);
}
return 0;
}
