C语言作业:用递归法做猴子摘桃

Python022

C语言作业:用递归法做猴子摘桃,第1张

#include <stdio.h>

const unsigned int &fun_last(const int &n,const int &day)

{

if(n<0) return -1

if(day==1) return n

return fun_last(2*(n+1),day-1) //当天剩n个,前一天剩下2*(n+1)个

}

int main(void)

{

int day=10,n=1

printf("第一天摘下%d个桃子\n",fun_last(n,day))

return 0

}

#include"stdio.h"

int tao(int t)

{

int m,a

if(t==10)

{

m=1

}

else

{

a=tao(t+1)

m=2*(a+1)

}

return m

}

void main()

{

int m,n

for(n=1n<=10n++)

{

m=tao(n)

printf("第%d天 =%d\n",n,m)

}

}