The classical problem of the classic question of C language 10: Rabbit-born rabbit problem

//2. Classical questions: There are a pair of rabbits, from the third month after birth, every month, a pair of rabbits, the rabbit long to the third month after the birth of a pair of rabbits, if the rabbit is not dead, the total number of rabbits per month? //find Patterns according to questions 1 pairs, 1 pairs, 2 pairs, 3, 5, 8, 13, 21 ... you can find the sum of the total number of rabbits in the first one months from the third month after two months.    intm[ at]; inti; m[0]=m[1]=1;  for(i=0; i< -; i++) {        if(i==0|| i==1) {printf ("the number of rabbits in the first%d months is: 1 pairs \ n", i+1); }        Else{M[i]=m[i-1]+m[i-2]; printf ("the number of rabbits in the first%d months is:%d pairs \ n", i+1, M[i]); }    }

The classical problem of the classic question of C language 10: Rabbit-born rabbit problem