0 like 0 dislike
2k 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

[Exam] asked in Midterm
ID: 23785 - Available when: Unlimited - Due to: Unlimited

reshown by | 2k views

44 Answers

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

int main()

{
** *** * ** * ** ** * a,i;
** * * ** ** * ** * * * long b[100];


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

    {
* * * ******* * * * * * * *** * ** * * ** **
** ****** *** ** ***
* * * * *** *** ****** * * ***** ** *** ****

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



int main(){

long long int f[90];

int i;

int n;

int b;

for * * * *
* ***** * **** * * * *
*** **** ** *** ******
* * ** ** * *** * ** ** * if(i==1)
** * * *** *
**** ** * **** * * ** *
*** ** *** ******* * ** * * * ** *
**** ** ** * * * * * * ** * * ** *

}


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


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



b=f[n-1];


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

}

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



int fab(int in);

int main(void)

{


* * * * *** * ** ** * in;
* ** ** * * *** * * * ****** * * ** ***
** ** * ** * ***** **** ** * * * ** * *** **
**** * *** * * * ** ** 0;

}

int fab(int in)

{
** *** *** ** ** * * ** * *
* * * * *** **** **** ** ** * * * ***** * 1;
* * ***** *** ***** * * **
***** *** ** * ** **** * * * * * ** fab(in-1)+fab(in-2);

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

#include * * * *** *



int main()

{
* * ** * ** * * ***** long int a1=0, a2=1, a3=1, n, i;
* *** *** *** * ** ** * ** * * &n);
*** ** * * *** ***** i<n-1; i++)
* *** * * ** ** *
* ** * ** * ** ** ***** * * * ** * * ** = a1 + a2;
** * ** * ** * * ** * ** * ** * ** * = a2;
** * *** * ** ** * ** ***** ** ** * = a3;
** * ** * * * **
*** ** *** * * ** ** * ** *** * ** * a3);
***** ********** ** **** 0;

}
answered by (-364 points)
0 like 0 dislike
Hidden content!
** ***** ** **
* * * ***** * *
** * *** * * * * ** **

int main ()

{
** * * * ***** n,i;
* ** * **** * * long a[100]={};
*** ** * * * ***
** ** ***** * *
** * *** ** *** * ** *** * * **
*** * * *** ** **** **

  {
** ** * *** ** * * ** * ** *

  }
*** * * ***** * * *** ** * ** *



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

#include * *** *



int num, i;

long long * **** *****



void first (void);



int main(void){
* *** * * * ** * * * * *** * ****
*** *** * * ** * * *
***** ** ** ****** *** ** * * ** ** * ****
***** ** ** * ****** * **** * * 0;

}



void first (void){
* * ***** * ***** * * ***** *
* * **** * * * * * * **
**** * ** * ** * *** i<90; i++)
** ** * * * * ** * * *** **** * * ** ** ** * * **** *** *

}
answered by (-581 points)
0 like 0 dislike
Hidden content!
** ******* * *
** * ** * * ****** *



int * **
*** *** ** int aa;
**** ***** *** ** * ** * ** **
** * * ** long long int temp = 1;
*** * ** * *** long long int te = 0;
* * * **** * int i;
*** * * long long int * *
* * * * * == 1){
** * * ** *** ** ** * * * * ** ** *** *
**** * * * ** * * ** * * 0;
* ** ** * }
*** **** * **** if(aa == 2){
* * ** *** * ** * * * * * ********* *** *
*** * * ** ** * * * ** ** ** 0;
**** * ** ** }
* * * * * * **** ***** * ** ** ** * * * ** * ** * * ** * * **** **

**** * *** * *** * * ** * * = temp + te;
* * ** ** ** * * * * te = temp;
** ** ** * * * * * ** * temp = **


** ** * * * }
*** * ** ** * ******
* * * *

* * * * ** * ** 0;

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

#include <stdlib.h>



int main(){

    int input;
* * * * *** * ** * ** * ** ** *** * ** * *** ** *
** * ***** * * *** * * ** * *** *** ** ** int a[100];
* * * * *** * * *** * * * * * ** ** ********* * * i;
*** ** ****** * ** * ** *** * * ***** **** temp = 3;
* * ** * **** *** * ** * * ** *** ** *** = 1;
* ***** *** * * ** * * * * * * ** * * = 1;
**** ** ** *** * * ** ** ** * *** *** *** * * ** * * * *** ** **
* * * * * * * * * *** * *** * ** ***** ** ** ********* ** ***** * * = a[i] + a[i-1];
* * ** * ** * **** ** * ****** * ** **** * * * * ** * * *** *********
* ** * ** * ** ****** * * ** ** * ** *** ** *** * *
* * * * ** *** **** *** * * ** *** *** * * ** ** *** ** * * *

    }
* ** * * ** ****** * 0;

}
answered by (24 points)
0 like 0 dislike
Hidden content!
* ** * *** * **
*** ** ** ** ** * *



int * ** *
** * * *** int aa;
* ** * * * ** ** *** **** *
* * ** * * ** ** long int * = 1;
*** * ***** ** * long * int te = 0;
* ***** * *** int i;
*** * **** * long long int **
** ** *** ** * ** *** * * * ** ** * * * ***** * *** ** * * * * * * ***

** * *** ** * * * * * * * = temp + te;
* ** * * ** * * * ** * **** te = *
* * ** *** *** * *** ** *** temp = **


******* * **** * }
* ** * * * ** * * * ***** * * *
*** * ** ***

** * ** ** ** 0;

}
answered by (-134 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 (6 points)
Welcome to Peer-Interaction Programming Learning System (PIPLS) LTLab, National DongHwa University
English 中文 Tiếng Việt
IP:172.69.7.10
©2016-2024

Related questions

0 like 0 dislike
13 answers
[Exam] asked Apr 21, 2017 in Midterm
ID: 24269 - Available when: Unlimited - Due to: Unlimited
| 798 views
0 like 0 dislike
8 answers
[Exam] asked Apr 21, 2017 in Midterm
ID: 24273 - Available when: Unlimited - Due to: Unlimited
| 520 views
0 like 0 dislike
6 answers
[Normal] asked Apr 21, 2017 in Midterm by thopd (12.1k points)
ID: 24271 - Available when: Unlimited - Due to: Unlimited
| 453 views
0 like 0 dislike
70 answers
[Exam] asked Apr 13, 2017 in Midterm
ID: 23789 - Available when: Unlimited - Due to: Unlimited
| 3.2k views
0 like 0 dislike
46 answers
asked Apr 13, 2017 in Midterm by thopd (12.1k points) | 2.1k views
12,783 questions
183,443 answers
172,219 comments
4,824 users