day 5 兔子产子

Posted 2023-04-14 drz1145141919810

 

1.找出递推关系month[n]=month[n-3]+month[n-1];

2.依据已知条件得到month[0],month[1],month[2];

3.根据递推得到month[29];

 

 

 

#include<iostream>

 

using namespace std;

 

int main()
int month[30];
month[0]=month[1]=2,month[2]=4;
for(int i=3;i<30;i++)
month[i]=month[i-1]+month[i-2];

for(int i=0;i<30;i++)printf("第%d个月的兔子有%d只\\n",i+1,month[i]);
return 0;

 

 

 

 

103.兔子产子（菲波那契数列）

#include<stdio.h>
void main()

   int n,i,j,un1,un2,un;
   clrscr();
   puts("********************************************************");
   puts("*   This is a program to Calculate Rabbits Numbers.    *");
   puts("* There is a rabbit couple procreats 2 rabbits 1 month,*");
   puts("* and the young rabbits group and can procreats in the *");
   puts("* end of the second month. In this way,how many rabbits*");
   puts("* are there after n generations?                       *");
   puts("********************************************************");
   for(n=2;n<3;)
   
      printf(" >> Please input number of generations (n>2): ");
      scanf("%d",&n);
      if(n<3) printf("\\n >> Input error!\\n");     /*控制输入正确的N值*/
   
   un=un2=1;
   printf(" >> The numbers of rabbits in first %d generation are as follows:\\n",n);
   printf(" l\\t l\\t");

   for(i=3,j=0;i<=n;i++)
   
      un1=un2;
      un2=un;
      un=un1+un2;      /*利用通项公式求解N项的值*/
      printf(   i%8?" %d\\t":"%d\\n",un);
   
   printf("\\n");
   printf("\\n Press any key to quit...");
   getch();