hdu 1165 Eddy's research II(数学题，递推)

标签：数学   acm   

// Eddy 继续

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).

1 3
2 4

5
11

打表，这才是真正的打表啊……

看到这个表，规律就不用我说了吧……

*************************/

Code:

#include <iostream>
#include <string.h>
#include <stdio.h>
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;
}

hdu 1165 Eddy's research II(数学题，递推),布布扣,bubuko.com

hdu 1165 Eddy's research II(数学题，递推)

标签：数学   acm   

原文地址：http://blog.csdn.net/gray_1566/article/details/24902443