#includemain(){int n = 1;//n为桃子数量,days=10,n=1for (int days= 9; days>=1; days--) //9次循环{n = (n + 1) * 2;printf("days%d\t%d\n",days,n);}}递归法#includeint N; //吃到N天还没吃时，剩1个，全局变量 int funn(int n){if(n==N)return 1;elsereturn 2*funn(++n)+2; } int main(){int days,y;printf("输入多少天后剩一个\n");scanf("%d",&N);for(days=1;days0) {x1=(x2+1)*2;/*第一天的桃子数是第2天桃子数加1后的2倍*/ x2=x1; day--; } printf("the total is %d\n",x1); }
|
