zoukankan      html  css  js  c++  java
  • HDUOJ----1165Eddy's research II

    Eddy's research II

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


    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
    代码:
     1 /*@coder龚细军*/
     2 #include<stdio.h>
     3 int Ackermann(int m,int n)
     4 {
     5          if(m==0) return n+1;
     6     else if(m==1) return n+2;
     7     else if(m==2) return 2*n+3;
     8     else if(m==3) return (1<<n+3)-3;
     9 }
    10 int main()
    11 {
    12     int n,m;
    13     while(~scanf("%d%d",&m,&n))
    14     {
    15         printf("%d
    ",Ackermann(m,n));
    16     }
    17     return 0;
    18 }
  • 相关阅读:
    Hibernate 多表查询结果集的处理
    is not mapped [from错误
    input输入框内,焦点后文字消失;placeholder 与 value 区别
    滚动文字JS
    安装mysql和xampp遇到问题
    python数据结构总结
    翻译二--创建一个Web测试计划
    jmeter元件执行顺序及简介
    testlink for windows 安装
    postman使用
  • 原文地址:https://www.cnblogs.com/gongxijun/p/3488150.html
Copyright © 2011-2022 走看看