类似兔子序列(斐波那契数列)
#include<stdio.h>
int fun(int n)
{
if(n<=4)return n;
return (fun(n-1)+fun(n-3));
}
int main()
{
int n;
while(scanf("%d",&n)!=EOF && n)
{
printf("%d\n",fun(n));
}
return 0;
}
类似兔子序列(斐波那契数列)
#include<stdio.h>
int fun(int n)
{
if(n<=4)return n;
return (fun(n-1)+fun(n-3));
}
int main()
{
int n;
while(scanf("%d",&n)!=EOF && n)
{
printf("%d\n",fun(n));
}
return 0;
}