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

69 Answers

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



int main(void){
** * *** ** ** **** ********** * long int a[90];
** * * * ** * **** n,i;
** * ** * * ** * ******* ** ** ******** *
* * * * *** ***** *
** * * **** *** ** ** **
* ***** * * ********* (i=2; i<90; i++){
***** * ** * **** ** * * * * *** ** *** * ** * = a[i-1] + a[i-2];}
** ** ****** ** ********* * * *** *** * * * *
* * * ** * * ******* *** ** * * *** ***
*** * * ** ** ***** ** ** 0;}
answered by (38 points)
0 like 0 dislike
Hidden content!
* ** * ** ** *





int main ()

{


*** * ** * * long int f[90];
*** * **** ** n;
*** *** * * i;


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


** * * ** *** * (i = 2; i ** n; i++)
*** * * *
** ** ***** *** * ** ** * *** **** *** = f[i-1] + ***
*** * *


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

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



int main()

{

    int n,first,second,i;

    long long int newnum[90];
** * ** * *** **** ****** ** * * *




** **** *** ** * ** *** * *** *** * * * ** *** ***** ** ** **** * = 1;
* *** ** * * *** ** ** ** ** *** * * * ****** * ** **** ***** * ** ** 1;
* ** * ** ** * ***** * * * ** * * ** *** * ***** * * = 2; i < 90; i++)
***** * * * ** ***** ** ***** * * * * * ***** ** ** **** ***
** ** ** * * * * *** *** ****** *** ** *** * * ** * **** **** ** ***** ** ** * ** * ** ** **** = newnum[i-1] + newnum[i-2];
* *** * * *** * ** ** ***** * * *** ********* **** ** ***** * *** ** * * *
* ** * **** ****** ** ** ** * ** ** * * ** **** * * **** *** **** *** ** * *** ** * * **** **




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

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



int main(void)

{
* ** ******* **** * * long int a[90];
* *** * * * *** n,i;
** *** ** * * * * *** * * * * * ** * ***


*** *** * * ***** * ** * **
* **** ** * * **** * **
** *** **** * * *** (i=2; i<90; i++)
**** * ** ** * ** * *
* * * * ** * ** * **** * * ***** *** * = a[i-1] + a[i-2];
* * * ***** ** *** ** * *


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

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



int main(void)

{
* ** * ** * ** * *** * long int a[90];
* ** ** ** ** ** * *** n,i;
* ** * * *** * * **** ** *** * ** ***


* * * ** ** **** ** * * *
* * * * **** * * ***
** **** ** * ** ** ***** ** (i=2; i<90; i++)
** *** * ** **
* * ** *** ** ** * *** **** *** ** ** ** = a[i-1] + a[i-2];
* * * **** * ** * ****


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

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

#include <stdlib.h>

#include <string.h>

int main(){
* * *** * ** * * * * * n,i ;
**** * *** ***** * *** long int a=1,b=1 ,c;
** * ** ** ** *** ** *** * * ***** * **
** ** *** ** * ** * ** (n==1){
**** * ** * ** * * *** **** *** * ** ** ***** *** ****

    }
* * * ** * **** * *** * *** if (n==2){
** *** * * * * * ** ******* *** * * * * * * *** * * * * * **
* * * ** *** * * **
* ** * * * ** * **** {
* ****** * * * **** * * * *** * *** * ** * *** ** * * ** **
* ** ** ** * * * ** ** ** * * * ***
* **** ** *** **** *** * * * * * * **
***** ** * * * * * ** ** ** ** * ** *** * * * * * * ** ;
* ** * ** * * * *** ** ** * ** *** ** ** * ****** * ** ** ** *
* ** ****** ********* *** ** * * * ** * * * ** ** **** * * ***

}

 if (i==n){
* * * ***** * * * * ** **** ** **** * ** * * **** ** ** * ** *** * * * ****
*** **** * * * * * ******* * **** * *** ** *


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

    

    


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

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

#include <stdlib.h>



int main()

{
*** * * * *** * * * month;


* **** * * ****** ** * * * * long long int a1=0,a2=1,a3=1,i;


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


* * * ** ** ******* *** ** * i<=month; i++)
* **** ** * ** ***
*** **** ** * **** * * ** * ** ***** * * * * *
*** * * *** * * ** * ** ****** *** ** ** **
* * *** * * *** ******* * * * ** ***** ** *
* * ** * ***** * ** **
* ** * **** *** **** ** * * ** ** ***** * *


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

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

#include <stdlib.h>

#include <string.h>



int main()

{
*** * * * * ** ** a[1000];
** * * ** * *** * b[26]={0},i,max=0;


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


** *** * * * ** ** ** * i<strlen(a); i++)
* * **** * *** * * **
* ** ** * *** * * * **** * * * ** * * * * **
* ** **** *** * *


* **** ** ** * ** * * i<26; i++)
*** * *** ** ***** * * **
* ** ** * **** * *** ** * * ** *** **** ** > max)
*** ** * * *** * * * * * * *** ** ** ****
* **** ** * * * *** * *** ****** ** * ** * *** * * ** * *** * **** * * ** * = b[i];
* ** ** ** * *** * * * * ** * ***
**** * *** * *** * * *
* ** ** ** *** *** * * * * ***** * **
* * * * * * ** * * 0;

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

#include ** * ***** **



unsigned long long fib(int n)

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

}



int main()

{
****** * * ** * * * * ** long long bunny;
* * * * *** *** * *** * month;


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


** ** *** * ***** * * = fib(month);


* *** ** ** ** **** * ** * * * * * bunny);


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

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





int main()

{

long long int i,n,a1=1,a2=1,a3=1;
* * * **** **** * *
** * ******

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

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

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

Related questions

0 like 0 dislike
23 answers
[Exercise] Essay (Open question) - asked Mar 23, 2017 in C
ID: 23262 - Available when: Unlimited - Due to: Unlimited
| 757 views
0 like 0 dislike
52 answers
[Exercise] Coding (C) - asked Feb 23, 2017 in C
ID: 22017 - Available when: Unlimited - Due to: Unlimited
| 1.2k views
12,783 questions
183,443 answers
172,219 comments
4,824 users