母牛的故事
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 42192 Accepted Submission(s): 20989
n=0表示輸入數據的結束,不做處理。
每個輸出佔一行。
#include <stdio.h> int num(int n) { int sum; if (n<=3) sum=n; else sum=num(n-1)+num(n-3); return sum; } int main() { int n,number; while(scanf("%d",&n)!=EOF&&n!=0) { number=num(n); printf("%d\n",number); } return 0; }
注意:利用遞歸算法解題