1167：再求f(x,n)

1163：阿克曼(Ackmann)函数
#include<cstdio>
#include<iostream>
using namespace std;
#include<cstring>
int sum(int m, int n)
{
    if (m==0) return n+1;
    else if(m>0&&n==0) return sum(m-1,1);
    else if(m>0&&n>0) return sum(m-1,sum(m,n-1));
}
int main()
{
int m,n;
cin>>m>>n;
cout<<sum(m,n)<<endl;
return 0;
}

//1164：digit函数
#include<cstdio>
#include<iostream>
using namespace std;
#include<cstring>
void sum(int n, int k)
{
    int i=0,temp;
temp=n%10;
n=n/10;
if(k==1)    cout<<temp;
else sum(n,k-1);

}
int main()
{
int m,n;
cin>>m>>n;
sum(m,n);
return 0;
}

1166：求f(x,n)
#include<cstdio>
#include<iostream>
using namespace std;
#include<cstring>
#include<math.h>
double sum(double x, double n)
{

if(n==1) return sqrt(1+x) ;
else return sqrt(n+sum(x,n-1));

}
int main()
{
double x,n;
cin>>x>>n;
printf("%.2lf",sum(x,n));
return 0;
}

1167：再求f(x,n)//主要确定前后的关系和最后递归边界，找到停止递归的条件和发现前后调用的关系 是关键
#include<cstdio>
#include<iostream>
using namespace std;
#include<cstring>
#include<math.h>
double sum(double x, double n)
{

if(n==1) return x/(1+x) ;
else return x/(n+sum(x,n-1));

}
int main()
{
double x,n;
cin>>x>>n;
printf("%.2lf",sum(x,n));
return 0;
}