0 like 0 dislike

Please use recursive function. 請使用遞迴函數

In mathematics, the Fibonacci numbers or Fibonacci sequence are the numbers in the following integer sequence: 0,1,1,2,3,5,8,13,21,34,55,89,144

前13的斐波那契數列:0,1,1,2,3,5,8,13,21,34,55,89,144

By definition, the first two numbers in the Fibonacci sequence is 0 and 1, and each subsequent number is the sum of the previous two. In mathematical terms, the sequence Fn of Fibonacci numbers is defined by the relation  with seed values F0 = 0, F1= 1

斐波那契數由0和1開始,其後的數就由之前的兩個數相加。用數學表示 F0 = 0, F1 = 1

Write a program that asks the user to type an integer n, then display Fn on the screen.

寫一個輸入一個整數n,輸出第n個斐波那契數的程式

Example input 1:

5

Example output 1:

5

 

Example input 2:

12

Example output 2:

144

 

[Exam] asked in Final Exam
Available when: 2018-01-20 09:00 - Due to: Unlimited
| 21 views

6 Answers

0 like 0 dislike
Hidden content!
#include ***** ***** ***

int fib(int);

int main(){
*** * ** *** * num;

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

* ** * *** * ** * *** ** * * * * ** * fib(num));

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

int fib(int n){

* * ** ******* * * *** num[n];
** ************ ** **** * ***
* * * ***** *** *****

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

* ****** ** * * * ** ** num[n];
}
answered by (-74 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
0 like 0 dislike
Hidden content!
* *** * * * *
int main (){
int * *****
* ** * * * ** input: ***
* * ** ***** ** * * * *
* ***
******
* **
* ****
** * * ** * *

return 0;
}
answered by (16 points)
0 0
Case 0: Wrong output
Case 1: Wrong output
Case 2: Wrong output
Case 3: Wrong output
0 like 0 dislike
Hidden content!
#include <stdio.h>
#include *** * * **
#include * * ***** *

int fib(int n)
{
* *** *** **** * ** ** * (n == 0)
* * * * ** * * ***
********* * **** ** * * * * *** *** * * 0;
* ** * * * ** * *

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

** *** * * * * ** **
* ***** ** ** * ** ** * ** * * * ** * * * fib(n-1)+fib(n-2);
}

int main()
{
* * ** ** n;
* *** * *** * fn;

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

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

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


* ** *** * * ** * * * 0;
}
answered by (-403 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
0 like 0 dislike
Hidden content!
#include <stdio.h>
int fib(int n)
{
*** * *** * *** * * * (n==0)
* ** * ****** * ** *
** ** **** * * ** *** ** ** ********** * ** * 1;
***** ***** * ** ** ***
** * ** * ***** *** * * * if (n==1)
******** *** ** * *
* * * *** * ** ** * * * * ** *** * * ** *** * * 1;
****** ** *** ** ** ****
***** * ** ** ** **** ** if (n==2)
    {
* * * ** *** ** ** ** * ***** * * ** * * 1;
**** * **** ** * **
****** * * * * ** ** **
    {
* ** ** * ** ** *** ** ** * ** **** ** * * ** ** fib(n-1)+fib(n-2);
* ***** * * * * ***** *
}
int main()
{
** ***** *** *** ******* * n;
** * * * * *** * * * * ** * * ** * *
*** ** * *** **** * *** ** * * *** * * ** *
** *** * * *** * * * ***** * ** 0;
}
answered by (-191 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
0 like 0 dislike
Hidden content!
#include <stdio.h>
#include <stdlib.h>

int num,i;

int main()
{
* * ******** * ** * ** * *** * * *** ** *

*** ** *** * * * fib[num];

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

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

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

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

** *** ***** * * *** *** ** * * * * *
** * * *** ** * * **** 0;
}
answered by (-242 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
0 like 0 dislike
Hidden content!
#include<stdio.h>
int main(void)
{
********** ** ** * * * * tab[100]={0};
* * * * ** ** * * * * * i,num;
* * ** ** * ** * * * ****** *****
****** * ** * * *** * **
* * * ** * * ** * ** *
   {
***** * ** * ** ***** * * ** ** * ***** *
*** * ** **** * * *
* * ** ** ** *** *** * ** * * ** ** *** * * **
* ** * * ** * * ** **
* * ****** * *** * ** ** ********** ** *
   }
******** ****** *** *
   {
* ** ** ** * * ****** ** * * **** ***** ******* * * **** ***
*** **** * *
** ******* **** * ** * (num==1)
** * * ** * *
* * * ** * * ****** ** ** * * **** ***** *
   }
* * * * **** ** 0;

}
answered by (-168 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
Get it on Google Play Welcome to Peer-Interaction Programming Learning System (PIPLS) LTLab, National DongHwa University
English 中文 Tiếng Việt
IP:172.69.62.160
©2016-2019

Related questions

0 like 0 dislike
13 answers
[Exam] asked Jan 19, 2018 in Final Exam
Available when: 2018-01-20 09:00 - Due to: Unlimited
| 32 views
0 like 0 dislike
8 answers
[Exam] asked Jan 19, 2018 in Final Exam
Available when: 2018-01-20 09:00 - Due to: Unlimited
| 21 views
0 like 0 dislike
4 answers
[Exam] asked Jan 19, 2018 in Final Exam
Available when: 2018-01-20 09:00 - Due to: Unlimited
| 21 views
0 like 0 dislike
12 answers
[Exam] asked Jan 19, 2018 in Final Exam
Available when: 2018-01-20 09:00 - Due to: Unlimited
| 30 views
2 like 0 dislike
31 answers
[Exam] asked Jan 16, 2018 in Final Exam
Available when: 2018-01-17 14:00 - Due to: Unlimited
| 34 views
8,792 questions
72,281 answers
47,105 comments
2,033 users