12-14 Exercise 3: Fibonacci numbers (Recursive)

0 like 0 dislike
3.2k views

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

 

[Exercise] Coding (C) - asked in Chapter 9: Functions by (5.2k points)
ID: 37370 - Available when: 2017-12-14 18:00 - Due to: Unlimited | 3.2k views

41 Answers

0 like 0 dislike 
Hidden content!
#include *   **   * *** * 
int F(int n)
{
* ** * *** ** ***   ******   **
 ** *      * * *  ***  **       1;
 ** * ********  *  *  
       *    *  *****   *** 0;
  *  ** *** *** *  ***** ***  F(n-1)+F(n-2);
}

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

 ** *  **    * *  *  * 0;
}
answered by (-140 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include  * ***  **  *  * 
int F(int n)
{
 ** * ** ** ***** ***   ****** 
 *** *  **   * * *    * **  *  1;
   *   *  *   *  *** * 
 ***  *    * *** * * ***    **  0;
**   ***    * * **  * *** F(n-1)+F(n-2);
}

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

 *  *   **       *  * *** 0;
}
answered by (-32 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
int F(int n)
{
 ** * * ** **** * **   *   *** 
  *     *** *  *   **** * **   1;
 *  * ***** ***  ** * *
 *** *** * *  *         *     *  **  0;
** * ****  ** *** *   F(n-1)+F(n-2);
}

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

  *** * *   **** *    ***  * 0;
}
answered by (-32 points)
0 0
prog.c: In function 'main':
prog.c:13:4: warning: implicit declaration of function 'scanf' [-Wimplicit-function-declaration]
    scanf("%d",&n);
    ^~~~~
prog.c:13:4: warning: incompatible implicit declaration of built-in function 'scanf'
prog.c:13:4: note: include '<stdio.h>' or provide a declaration of 'scanf'
prog.c:14:4: warning: implicit declaration of function 'printf' [-Wimplicit-function-declaration]
    printf("%d",F(n));
    ^~~~~~
prog.c:14:4: warning: incompatible implicit declaration of built-in function 'printf'
prog.c:14:4: note: include '<stdio.h>' or provide a declaration of 'printf'
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include <stdio.h>
int fibo(int);

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

   *     *  * *  * *  **  ***  *   * ** *  &num);
   *  *   *     *  * *  *  (num > 0)
   **** *** ** ** *  **  **** * 
    *   * * *     ** *** ** *****  *  *  ** ** *** ***  *** = fibo(num);
*    *  ***  ** *     **   * ** ***  * ** ***   ********    *** ** ******   **  
****   * *** ** ***  *  **  ** *
* *** *  ** ** ***  *****   *** 0;
}
int fibo(int num)
{
  *   * * *** ****** * **       (num == 0)
 * ******   *  ** *** ****   
  *  ** * * *    *  * **    *  ** *** ** ****   *  ** * *** ** 0;
 **  *     *   *     *   ****  
*  *  *    *  * *    ** * * if (num == 1)
    ***   * * **     *     
**       ***  *** * *  * *    *** ******  ******** **  *  1;
* ** ** * ** *** *   * **   * **
*******      ****  *   *      * 
** *** * **** **   **  *     * 
* **  ****  ***  *** * **** *    *   * ** ** **    ** **** * * - 1) + fibo(num - 2));
    }
}
answered by (-284 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include <stdio.h>
int fibo(int);

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

** *******  *** ***** *  ** *   ** ** * *** *** ** &num);
* *****   **** *  *   * *  **  (num > 0)
** *   *  * **    * *
* *  * * ** **  * * ** *  **  ***  * *****    ****  ** ** = fibo(num);
** *    **   ****  **** **** *   **  **        **** *  ******  *  *   **   ** *   *
  ***   **    *   ** *  * * 
***  *  *** *  *     * *     *  0;
}
int fibo(int num)
{
***  *  **  *** * *** * **    (num == 0)
*******  **  * *** *  *  *  *
*** ** * *  * ******  * * **  *** ***   **    * * * 0;
** * **** * ***  ** * ***  **
** **    *   * ***  **     *****  * if (num == 1)
* * *    ***** *  * *
***** ****** **    ****** ** *** ** ** **    ****** * *  1;
* * ** * *  *   ***    ****
     *** * *  * * * * *** *
**** ****  *  ***  **  *  *
  ** *****  ** *    * *   *   *  **    ***  **     *  *** - 1) + fibo(num - 2));
    }
}
answered by (-108 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include <stdio.h>
int fibo(int);

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

 * *  * *  **   ** ** * *****       * *     **  &num);
 *     ***   **** * *****   * ** (num > 0)
    ** * **** ****  *** ** *
** *    **   **     *   *  **     **  ** *** ***  ***    = fibo(num);
 *  ** ******   *  *  ****** ** ****   *   **  *** * ********   *  * ** *   
    ** **  **  **   *    **
**** *** ** *  ****** *   **  * *   *   0;
}
int fibo(int num)
{
 ** *** *   ***** * *  ** (num == 0)
 ***** *     *** **     
*   **  ****** * *** * **   *  ***   ** *       ** *  * 0;
    *   ****  ** *** **  *  
   *  ****   *   *  ***    ****    if (num == 1)
***** **  **  ***    ****  
**    * **** ****   *  *  * **   ***  **  * ****   * 1;
**** ** *   *  ***   *     ***
 ***   ***   **** ***    * * *
  * * *    *  ** **  ***  ***** 
*  ***** *  ****  *  *** * ****   *****    *** *  ** **  - 1) + fibo(num - 2));
    }
}
answered by (-168 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include **       ***

int fn_num(int number)
{
* *  * **    * *   *  *  * ***   *** == 0)
   *      * * *   *  ****      ** *  *  * ** *****   * * 0;
* *  **  ***** ***   ** ** **   ** if(number == 1)
     ** * ******** *   *****  *   ********   * ***   **     1;
***   **   * **   ***  **    * **  
*  *  ***       *****      * *** *  ** ********* ** *  fn_num(number-1) + fn_num(number-2);
}

int main()
{
*  *  **   *   * **   *  **  number;
    ***   ********* *  ** **  fn;
 *  *  *  ** *
  *  **** ****  * * *  *  **  ***     *  * &number);
 * *****  *   ** * * **     *
   **  *********  * *** = fn_num(number);
  *** * *   * *       *
  * **  *   * * * ***** ** ** *  ***  *** **** fn);
    ** * *     ****    *   * ** 
**    *  * **   *   * * * *    *   0;
}
answered by (-193 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include<stdio.h>
int f(int);

int main()
{
    **** ** * ** **  **   ** * *   * n;
*  *   * * * *  * **  **  ** * *  ** **     **  *    *
  * *** * **** * * ****   
    **  ** ***  ** *** ****  ** * ****   *** f(n));
*     **       ***     **  * *
}

int f(int n)
{
**** *** *** *   **  * * **  ( n == 0 )
*       **** ** **  *  ** *   ** *   * *     ****     0;
 *  *   ** **     *******   ** if ( n == 1 )
*   *** ** * * *  * *    *    *  * *  *    **   *  ****** *  1;
 * *******  *  ***  *** ***
***** * ********  * **** *  **    * ** *  ** ****   ( f(n-1) + f(n-2) );
}
answered by (323 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include<stdio.h>
int f(int);

main()
{
  * *       *    * * *  ** n, i = 0, c;
************ *   * *   * **  **   * *  *   *  **   ***
*  * * *   ** *  *  *** *   *    ( c = 1 ; c <= n ; c++ )
  * *  **  **** * ** * ***** **
 **** ***  ** * * ********** * 
     **  ** *   * *****  * 
 * * *    *  ***   * ******   ****    * *     **  f(i));
   ****** ****  ****  **
}

int f(int n)
{
**    *   **  **   *      ( n == 0 )
  **  * * *   ** * ** ****  *  * **    ***    ** * 0;
  * ** *  ***  **** *   ** *  if ( n == 1 )
 *  ** *** * *** *** * * * *  ***    ****     * *   *   *   1;
* *   * *** *** *  * *    *****
   ****** * * ****    *** *   ****    *  *******  *  * ( f(n-1) + f(n-2) );
}
answered by (323 points)
0 0
prog.c:4:1: warning: return type defaults to 'int' [-Wimplicit-int]
 main()
 ^~~~
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include<stdio.h>
int f(int);

main()
{
*  ** *  *  ***   ***** *  * *    n, i = 0, c;
   **   ***** ***  **    *      *  *****      *** ****  **
     ***  *    *  **    ( c = 1 ; c <= n ; c++ )
*    ** ****   *  * *   **   *
**  **  *  * *  *     **   * 
***** ** ** ****  ** ***       
 *    ** **   **     * *     *** ** *  * *  f(i));
 ****  *  *   **    * ** *  **  * 0;
}

int f(int n)
{
*****  *** *  * *     * **  ( n == 0 )
   *** *     ** *     ***  *** **** * **** *    ** ***  0;
 ***** *     *  *  *  *   *   * *** if ( n == 1 )
**** ***** *  *   *****    *  **    ******    **** ** **   *  * *  1;
*  * * * **** * * ****** * *   
* * * *  ** **** **** *       **** * ***  ** ******* ( f(n-1) + f(n-2) );
}
answered by (323 points)
0 0
prog.c:4:1: warning: return type defaults to 'int' [-Wimplicit-int]
 main()
 ^~~~
commented by (4.3k points)
Page:
Welcome to Peer-Interaction Programming Learning System (PIPLS) LTLab, National DongHwa University
English 中文 Tiếng Việt
IP:172.70.131.45
©2016-2024

Related questions

0 like 0 dislike
46 answers
11-30 Exercise 1: Fibonacci numbers (Array)
[Exercise] Coding (C) - asked Nov 29, 2017 in Chapter 9: Functions by semicolon (5.2k points)
ID: 34912 - Available when: 2017-12-14 18:00 - Due to: Unlimited | 3.8k views
0 like 0 dislike
93 answers
11-01 Exercise 3: Fibonacci numbers
[Exercise] Coding (C) - asked Nov 2, 2017 in Chapter 6: Loops by semicolon (5.2k points)
ID: 29830 - Available when: 2017-11-02 18:00 - Due to: Unlimited | 6.6k views
0 like 0 dislike
50 answers
12-14 Exercise 2: Calculate GPA
[Exercise] Coding (C) - asked Dec 13, 2017 in Chapter 9: Functions by semicolon (5.2k points)
ID: 37278 - Available when: 2017-12-14 18:00 - Due to: Unlimited | 4.6k views
0 like 0 dislike
38 answers
12-14 Exercise 1: Calculate inner product
[Exercise] Coding (C) - asked Dec 13, 2017 in Chapter 9: Functions by semicolon (5.2k points)
ID: 37277 - Available when: 2017-12-14 18:00 - Due to: Unlimited | 3.1k views
0 like 0 dislike
79 answers
12-28 Exercise 3: Anagrams function
[Exercise] Coding (C) - asked Dec 28, 2017 in Chapter 9: Functions
ID: 39986 - Available when: Unlimited - Due to: Unlimited | 7.5k views
12,783 questions
183,443 answers
172,219 comments
4,824 users