http://acm.hdu.edu.cn/showproblem.php?pid=1165

?

?

不看題解，使勁找規(guī)律，應(yīng)該是可以找到的，就是費(fèi)時(shí)間！

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 <stdio.h> #include <string.h> long fun(long m,long n) {if(n==0)return fun(m-1,1);else if(m==0)return n+1;else if(m==1)return n+2;else if(m==2)return 2*n+3;else if(m==3)return fun(m,n-1)*2+3; } int main() {long n,m,i,j;while(scanf("%ld%ld",&n,&m)!=EOF){//if(n==3)m==24;//else m=n;printf("%ld\n",fun(n,m));}return 0; }

?

轉(zhuǎn)載于:https://www.cnblogs.com/ccccnzb/p/3419272.html

總結(jié)

以上是生活随笔為你收集整理的hdu 1165 坑爹找规律题的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。