汉诺塔改编 #include<stdio.h> long long F(int num){ //递归函数,返回值较大时使用long long类型 if(num==1) return 2; else return 3*F(num-1)+2; } int main(){ int n; while(scanf("%d",&n)!=EOF){ printf("%lld\n",F(n)); } return 0; }