The quality of Rabbits

题目

古典问题：有一对兔子，从出生后第3个月起每个月都生一对兔子，小兔子长到第三个月后每个月又生一对兔子，假如兔子都不，问每个月的兔子总数为多少？

 

分析

---------------
My analysis
---------------
month              1  2  3  4  5  6  7   8   9   10  11 ...
num（couple）   1  1  2  3  5  8  13 21 34  55  89 ...
A（couple）       0  0  1  1  2  3  5   8  13  21  34 ...

 

A is the number of the rabbits born this month

 

 

* 提供题目的朋友算法为当前月的数量为前两个月数量之和，比我的算法更为简洁

 

 

 

代码实现（C）

#include <stdio.h> #include <time.h> int main() { clock_t start, end; //A records number of the rabbits born today //a records number of the rabbits born yesterday to calculate the number tomorrow //num is the total quality of the rabbits int A=0, a=0, month=1, num=1, sign=0; printf("Please input how many months later you want to know the rabbits' quality?/n"); scanf("%d", &month); start = clock(); //Because the rabbits cannot give birth to rabbits until the third month, //so the quality will not change in the first 2 months if(month < 3) printf("The quality of the rabbits is: %d/n", num*2); //In the third month, the rabbits NO1 give birth to two rabbits NO2 //Actually the number of the rabbits born this month is A+a //Please think about it by yourself //So this month the quality of the rabbits is N+A else { int m; for(m=3; m<=month; m++) { if(m==3) { sign = A; A = 1; a = sign; num = num + A; } else { sign = A; A = A + a; a = sign; num = num + A; } } printf("The quality of the rabbits is: %d./n", num*2); } end = clock(); printf("The time is: %d ms./n", end-start); return 0; } /* In Visual Sutio 2008 the size of unsigned int is 4 bytes, so its maximum value is 4294967296. As a result this program can calculate the quality of the rabbits after 46 months at most. */

 

 

 

 

如果朋友们有任何建议或更好的想法请留言指教！