zoukankan      html  css  js  c++  java
  • hdu 1165 坑爹找规律题

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

    不看题解,使劲找规律,应该是可以找到的,就是费时间!

    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
    ",fun(n,m));
        }
        return 0;
    }
  • 相关阅读:
    内存分配小问题
    从MACHINE_START开始
    Linux驱动学习(二)
    9,斐波那契数列 6,旋转数组找最小 8青蛙跳台阶 JAVA实现
    数组练习题
    类的练习
    for循环练习题
    封装练习题
    Facebook成为Apache基金会的白金赞助商
    Visual Studio 2010
  • 原文地址:https://www.cnblogs.com/ccccnzb/p/3419272.html
Copyright © 2011-2022 走看看