2-23 Lab Exercise 2: How many rabbits?

0 like 0 dislike
10.9k views

    Suppose there is a pair of newborn bunnies in the pasture in the first month, each pair of male and female bunnies grew into a large male and female rabbits after two months later. After three months from the start, each pair of male and female rabbit can give birth to a pair of small bunnies every month. If the rabbits can live forever, how many pair of rabbits in the pasture in the first N month?

(1<=N<=90)(Very IMPORTANT)

Input

3

Output

2

 

Input

5

Output

5

 

Input

88

Output

1100087778366101931

[Exercise] Coding (C) - asked in C
ID: 22018 - Available when: Unlimited - Due to: Unlimited
edited by | 10.9k views

69 Answers

0 like 0 dislike
Hidden content!
#include <stdio.h>







long long int rabbit(int n)



{


** * * ** ** * * ** * * * * long int value1, value2, value3;


** ** * * * *** count = 1;


** *** *** *** ******* * ** = 0;


* ** * ** * *** * * = 1;


* * * * * ********* (n == 2)


** ** * ** **** ** * ** **** ** * 1;


**** ** *** ** * * *** * if (n == 1)


**** * ** *** * * * **** ***** * * * * 1;


* *** ** ** ***** *** * **


** * ******* * * ** *** *** ** ** (count < n)


* * *** *** *** *** * ***** ** **** * ***


** ** *** ** * * * **** ** * * * ** ** ** *** **** **** * *** * ** = value1 + value2;


**** **** * * *** ** ***** * * * ** * * ** ** * * * *


** **** * **** ** * * * * * ** * * * ***** ** * ******** ** * * = value2;


* * * * *** ** * * ** ** * * * * *** * ** *** * ***** ****** ** ******* * = value3;


** **** * * * * * * ***** **** **** * ** **** ***


********* ** * ** *** * ** * ** * * * * ** * value3;



}



int main()



{


* *** **** ** ** ** ** num;


* * * *** * ** *** * * ** ** * ** *** &num);


* * * ** *** ********** * * *** * * * * rabbit(num));


** *** ** * ** * **** 0;



}
answered by (6 points)
0 like 0 dislike
Hidden content!
#include <stdio.h>







long long int rabbit(int n)



{


* **** * * ****** * * long int value1, value2, value3;


** * ** **** ** * * * * ***** count = 1;


****** ** ** * * * ** = 0;


** * ** * ** * * * * ***** = 1;


* *** * * ** ** ** *** *** (n == 2)


* * * * * ** * * ** * ** ** * ** * * * 1;


* * * *** ****** * * * ** if (n == 1)


* * **** * * * ** **** * * **** * *** ** * ** * 1;


*** ** * * **** ** * **


* ** * * ** * ***** ** ** * * **** ***** (count < n)


* ** * ** * * * *** * ** ** ** ** *


* * ** * ** *** ** * **** * **** ** * *** * * * * * **** * * *** * = value1 + value2;


* * ********* * * ****** ** *** * ** ** * ** * ** * * * *


* * **** ** * * * ** * * **** ***** * ***** *** ** * = value2;


*** * * * ** * * * * * * ** ** * * ***** * * ** * * ** * * * * * = value3;


** * * * * * * * * **** ** * **** *


* *** * *** * * **** * * * *** *** * ** value3;



}



int main()



{


** * * ** ** **** * ** num;


* ** * * ** *** * * * **** * * * * **** &num);


*** **** * ** * ** ** * **** *** * *** *** rabbit(num));


** * * * ***** * ** **** ** 0;



}
answered by (-298 points)
0 like 0 dislike
Hidden content!
#include <stdio.h>



long long int rabbit(int n)

{
* * * * * ** *** ** * *** * long int value1, value2, value3;
* ** * * ** * *** * ** ** count = 1;
*** *** * * * * * * *** = 0;
*** * ** ********* ***** * = 1;

    if (n == 2)
** * * ** * ** ***** **** * * ***** ** **** *** 1;
* *** ****** ** * * ** * if (n == 1)
** * *** ***** ** * * * * *** * ** ** *** * 1;
** ** ** * ** **** *** *
* *** * *** * * * * *** ** * * * ** (count < n)
* **** ** * * ** * **** * * * *** *** * * ** *
* * * ***** *** **** * * * * * * ** ** ** * * = value1 + value2;
* *** ** * * ** *** ****** *** ** *** * ** ** ** * *** * * *
** ** * ** * * *** ** * ** * *** ** *** * *** *** ** = value2;
* *** * * *** *** * * *** ** * ****** ** * * * * ***** * ** *** * * * = value3;
** *** * * ** ** **** * * ** * * * * * * *
* * * *** * ************* ** * ** ***** *** ** value3;

}

int main()

{
* *** * ** ** **** * ** ** num;
* * * **** * ** * ** * ****** ** * *** &num);
**** * **** ** * ** **** ** ***** ***** * ** * rabbit(num));
* * * ** * * *** *** ** 0;

}
answered by (237 points)
0 like 0 dislike
Hidden content!
#include <stdio.h>



long long int rabbit(int n)

{
* ** * **** * * ** long int value1, value2, value3;
****** * * ** * * ** count = 1;
**** *** * * * **** * * ** = 0;
****** * *** * * **** *** = 1;

    if (n == 2)
* * ** *** * ***** ** ** ** * ** ** 1;
*** * * * * * * * * * if (n == 1)
** * * ** * *** ** * **** * * **** ** ** **** * 1;
*** ** * * *** ***** **
* ** * ** *** ** * * * * *** * *** * ** ** (count < n)
* * * * ** * *** *** * ** * * *** * ******
* ** * * ** ** ** * ** *** * * * ** *********** ** *** * *** * = value1 + value2;
* * *** * *** *** * *** *** * ** ** ** **** * *** * * * * **** ** ***
* ** * * *** ******* * * * ** * * * ** ****** ** * ** ** * * * * *** * = value2;
** * * ** ***** * **** ** * ** * *** * * * *** *** * * = value3;
* * *** ** ** * * ** * * ** * * *
** * * * * *** * * ** ** * ** * * * *** ** value3;

}

int main()

{
* ** * * * * * * ** num;
** * ** ***** * * * * ** * * * * ** &num);
* **** ** * ** * ** ** * ** * ** rabbit(num));
** *** *** ** * ** 0;

}
answered by (-215 points)
0 like 0 dislike
Hidden content!
#include ***** ** * * ***

#include * *



int main()

{
** * ****** n, i;


* * * ** ** *** *** ** **** * &n) != EOF)
** * *** *
* * **** * * **** * ** * * **** ** ** long long int month[n];
**** * ** * **** * **** * **** *** ******* = 1, month[1] = 1;


** * *** ** ** * *** *** ***** * ****** = 2; i < n; i++)
* * * * *** *** **** * * *** ***
**** ** * *** * ** *** *** * **** * * ** * * * * * * **** = month[i-1] + month[i-2];
**** * *** * * ** * * * ** *** * * **


**** * * *** ** * ** **** * ** ** **** ** * ** * month[n-1]);
** * * *** ** *


** ** ** * * *** * 0;

}
answered by (38 points)
0 like 0 dislike
Hidden content!
#include <stdio.h>

#include * * * * ****



int main()

{
*** * ***** * * n, i;


*** ** *** *** *** * ** * * * * * &n) != EOF)
** *** **** * **
* * ** * ** * **** * * *** ** ** * * * month[n];
* ** **** *** * ** ** ********** * = 1, month[1] = 1;


*** *** *** * **** ** * ** * ** * * * * * = 2; i < n; i++)
** *** * ** *** **** * ***** * * * **
** * ** **** * ** * * * ****** **** * ***** * ** * *** ** ** = month[i-1] + month[i-2];
** ** ***** * * * ** * * *****


* * ***** ** *** ****** * * * * * ** ** * * ** * ** * *** month[n-1]);
* ** *** *** * * *


**** ***** * *** ** *** 0;

}
answered by (38 points)
0 like 0 dislike
Hidden content!
#include <stdio.h>



long long int rabbit(int n)

{
*** ** * * * * * long int value1, value2, value3;
** * * * * * * ** * ** count = 1;
* * * * * * *** * **** = 0;
* **** * ** ** ***** * = 1;

    if (n == 2)
* ** ** * ** * ** * ** ** * * * * * 1;
** **** * ** ** * * ** * if (n == 1)
**** * ** ** ** * *** ***** ** * ** * * **** 1;
**** ** * * * **** **
******** * * **** ** * ******* ***** * ** *** * (count < n)
* * *** ** ***** ** ** ** *** *** * * **
**** * ** ** **** ** *** * * * *** * *** * *** * *** **** * ** = value1 + value2;
* * * ** ** * * * *** * * * **** * ** * * * **** ***** * ** * *
* ** *** ** ** * * ***** * ** * * * * *** * ** ** * *** * ** * * * = value2;
* * *** * * * ** * ***** * * * ** * ** * ** ** * * * * ** * * = value3;
*** * * * * ********** ** * ** **** * *
* ** ** ** *** ******** * * * **** **** ***** * * ** * * value3;

}

int main()

{
****** * **** * ******* **** num;
* * ** ******* *** * *** ** * * * &num);
* ** ** **** * ** * * * * * **** ** rabbit(num));
* * * * ** * ***** *** 0;

}
answered by (126 points)
0 like 0 dislike
Hidden content!
#include <stdio.h>



int main()

{
** * ** ** ** ** i, num;
** * ** ** ***** ** *** * * long total = 0, rabbit = 1, pairs = 1;


** ** ** * * ** * ** ** * * ** &num);


* *** ** * ** * * ** * = 2; i < num; i++)
* ***** * * * *********


***** ** * ** ** * * ***** *** * *** *** *** *** ** = rabbit + pairs;
* * *** ** *** * **** *** ** ** * * ** * * *** ** * = rabbit;
***** **** *** **** ** ** ** * ****** * ** = total;


* ** *** * ** * **** *
** * ** ** * * * * * ***** == 0)
* * * * * * ** *
** ****** ** * ** *********** * ** * * * * * * * * * **
* ** * *** * * **** *** else if(num == 1)
** ** * *** ** ** **
** * * *** * ** * * * *** ** *** *** * * ** * **** * * ** * * ****
** ****** ****** * * else if(num == 2)
*** **** ** * ** **
* ** ****** **** * * * **** * * * ** *** *** ***** *
** * ** * * ** *** * else{
***** * * * * ** * * * * * ** * * *** * ** * ** ** * *

    }




* * ** * *** * * * ** **** ** 0;

}
answered by (-189 points)
0 like 0 dislike
Hidden content!
#include * *** ** **

#include * ** ****



long long int fib(int );



int main(){


** ** * * * *** * * N;
** **** * ** * * long int output;
* ** ** * **** * ** *** * * ** &N);
* * ****** * *** *** ** **** * ***** *** *** * ***
* ** ** * ******** * * ***** * * * * = fib(N);
**** * * *** *** * * ** * * ** * * ****** * * * ** * * **** ** *** * * output);
** ** * **** *** ***


* * ** * ** ** *** ****** * 0;

}



long long int fib(int * * * *
***** ** ** **** long int last_2nd = 1, last = 1, output;
* * * ****** i;
** * ** * * * * * ** ** == 1 || N == 2)
*** **** * * * ** * ** **** ******* **** * *** 1;
* **** ** ** *** ** * **
* ** * * ** ** ** ****** = 2; i<N; i++){
** ** *** * * * ** * **** **** * * ***** * * = last_2nd + last;
**** **** ****** *** *** ** * * **** ** * ***** ** ** = last;
*** *** * ** * ** * * * *** * * *** * * * ** * = output;
* * ** ** *
** ** *** *** ** * * output;

}
answered by (-188 points)
0 like 0 dislike
Hidden content!
#include <stdio.h>



long long int rabbit(int n)

{
***** ***** ** * ***** * long int value1, value2, value3;
* ****** ** ** ** ** count = 1;
** * * * ***** ** * * = 0;
** * **** ** * **** ** * ** = 1;

    if (n == 2)
* **** *** * *** * * ** ** * **** *** * * 1;
* * ** * * * * * **** * * if (n == 1)
* ** * ** * ** * ** **** * * * ** ** * *** 1;
* * * *** * ** * **** *
** * * ** * * * *** ** *********** ** * * * ** * (count < n)
**** * * * ** ** *** * *** * *** * ** *** *** * *
*** **** * *** *** ** * * * *** * ** ** **** * * **** *** * ** * *** **** = value1 + value2;
* ** ** * ** * ** *** * *** *** *** * **** *** * *** * ** * **** **
** ** * * ** * ** ** ** * * * * *** * * ***** ** * * ** * * **** ** * * * = value2;
* ** *** * ** * * * * ** * * ** ** * * *** ** *** * ** ***** * = value3;
* * * ** * * * ** ** *** * ***** * ** **
** * ** ** * ********** * ** * * value3;

}

int main()

{
*** *** ** * * ** **** ** num;
* **** * * * **** * *** * * * * * ** * &num);
* ** * ***** * * * ** ** ** * rabbit(num));
* *** * * *** 0;

}
answered by (-218 points)
Page:
Welcome to Peer-Interaction Programming Learning System (PIPLS) LTLab, National DongHwa University
English 中文 Tiếng Việt
IP:104.23.243.108
©2016-2026

Related questions

0 like 0 dislike
23 answers
3-23 Lab exercise 2: Dividing a program into files
[Exercise] Essay (Open question) - asked Mar 23, 2017 in C
ID: 23262 - Available when: Unlimited - Due to: Unlimited | 5k views
0 like 0 dislike
52 answers
2-23 Lab Exercise 1: Find the highest occurrence of a single character
[Exercise] Coding (C) - asked Feb 23, 2017 in C
ID: 22017 - Available when: Unlimited - Due to: Unlimited | 8.3k views
12,783 questions
183,442 answers
172,219 comments
4,824 users