0 like 0 dislike
11.2k views

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 Fn = Fn-1 + Fn-2 with seed values F0 = 0, F1= 1

斐波那契數由0和1開始,其後的數就由之前的兩個數相加。用數學表示 Fn = (Fn-1) + (Fn-2),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 6: Loops by (5.2k points)
ID: 29830 - Available when: 2017-11-02 18:00 - Due to: Unlimited

edited by | 11.2k views

93 Answers

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

# include <stdio.h>



int fib(int n){


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


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


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



}



int main(){



    int input, i;


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




** * * * * * *** ** * *** ** * * * * ** * * ** ** *** * * ****** &input);


* *** * * * ** ** *** * ** ** * * ** * **** ***
* ** *** ** ** *** **** * ** ** **** ** **** **** * ** * ** * * ** **** * * *** * ** * cannot less than 0\n\n");


* * ***** ** * **** * ** ** ******** *
* * * ** *** * ** *** ** * * * **** ** ** * * *** * ** *** ** * * i<=input; i++)


* **** ***** * * * ** **** * **** ** * * * * * ***** ***** * **** ** ***** ** ** ** ***** ****
**** * *** ** ** * *** * *** * * * * *** *** ** * * *** ** ***** * ****** *** **** *** * * ** * * ** fib(i));
* **** * **** ** * **** *** ** * * * ** ** * *** * ** ** * **** **** ** ***** * * * *** *
** ***** * *** ** ** ** * * **** ** * * *** *



    }


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



}
answered by (-336 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 <stdlib.h>

# include <stdio.h>



int fib(int n){


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


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


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



}



int main(){



    int input, i;


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




** * *** **** *** ******** ** * *** * **** ****** ** * *** ** * ** &input);


******* *** * * * * ** ** ** * ** * ** * *** *
* *** ** ** ** **** ** *** ** * ** *** * ** * ** * * * * * ** ** ** cannot less than 0\n\n");


* * * *** * **** ** *** * * ** * ****
** ** * ** * * * ** ** ** * * ** ** * *** * ** *** * **** **** i<=input; i++)


* ****** * ** * ** * * * ** ***** * * ** *** * ** * ** *** ** ** *** ** *** ** *** ** *** **
* * ** *** * * ** *** ** * * * **** * * * ** * * ******** * ** **** ** *** **** * * ** * * ** ** * * fib(i));
* ** * * * * ** ** ** *** * ** ******** * **** * * ** * *** * ** ** *** *
** * * ** * * * * * * **** *********



    }


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



}
answered by (-336 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 <stdlib.h>

# include <stdio.h>



int fib(int n){


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


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


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



}



int main(){



    int input, i;


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




* * * * * * ***** * *** ** * ****** * ********* *** * **** &input);


*** * **** ** *** **** **** *** * * * **** *** ** *
* * * * * * * * * **** * ** * ** * ***** * *** * ** * * ** **** * * cannot less than 0\n\n");


* *** * ** *** * ** * * ** * * **** *
**** ***** ***** ** ** * ** ** **** ****** *** **** **** ** * * * i<=input; i++)


**** * *** * *** **** * *** ********** * * **** ***** ** * ** * * ***** * *** **** *
* * ** * * ** ** * * ** ** ** * * ****** *** * * *** **** * ***** ** * ** **** * * ** * **** ******** fib(i));
* * ***** *** ** ** * * * * * * * * * *** ***** * * * * * * * ** * ** *** * *** * * *
* * ** * ** * * ** ** * * ***** * ** * **



    }


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



}
answered by (-336 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 <stdlib.h>

# include <stdio.h>



int fib(int n){


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


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


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



}



int main(){



    int input, i;


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




* * * * * * * ***** * ******** * ** * ** *** *** * * ******* * * ***** &input);


* ** * * * ** * *** * * * * ***** * * *
****** **** *** * **** * *** **** **** ** * * * **** ** * * * * ** ** ** cannot less than 0\n\n");


* ** ** * ** ** ** * * * * * *** * *** ** ********
* * *** * * ** ** * * * ** * *** * ** ** * **** * * ******** i<=input; i++)


*** *** ** ** *** ** * * ****** * ** ** * ******** * * * * * * * * * *** * * * * * *** ***
** ******* * * **** ** **** ** ** * ** * * *** * * *** ** * * *** *** * *** * **** * fib(i));
** * **** *** ** * * * *** ***** * * ***** * **** * *** * ** * *
** * **** * * * * * * * ** * ** *** ***



    }


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



}
answered by (-336 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 <stdlib.h>

# include <stdio.h>



int fib(int n){


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


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


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



}



int main(){



    int input, i;


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




***** * ** *** **** ** * *** * *** ** * * * ** ** ** * &input);


* ** * ** ** * ** * * **** **** ** * **** * *** ****
**** * ** *** * * * ** ** *** ** * ** ****** * ** * ** * * * * *** ** *** ***** ******* cannot less than 0\n\n");


** ** *** * ** * * * ** *** * ** * * * **
** * ** *** * *** ** * **** ** ** ** * ** * ******** *** * ** i<=input; i++)


** * * ** ** **** * ** ** * * * ** * * ***** * * *** ** *** ** * ** * * * * * ** * ** ******* **
****** * ** *** *** ** * * * * *** * ** ** ***** * *** * *** ** * * * * **** * ** * ** *** * fib(i));
**** ** * * *** *** * * * ** * ** *** * * * ** * * * * *** *** ** * *
* * * * ** * ** ** * ** * * **** **** * *** * *



    }


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



}
answered by (-336 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 <stdlib.h>

# include <stdio.h>



int fib(int n){


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


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


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



}



int main(){



    int input, i;


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




* * * ** ***** * * * *** ** * * * * ** *** * * * * ** &input);


** * ** ** * ** **** ** ** ******* * ** ** *
* * **** ** * *** * ** ** * *** ********* **** * *** ** * * * ******** * cannot less than 0\n\n");


* * ** ** ** * ** ** ******** ** * * *
* ** *** * *** ** * *** * * ** * * * **** * * * * * * * **** * i<=input; i++)


* ** * **** *** ** ** **** * * * ** * **** * ** * * * ** ** *** * * * **** * ** * *****
** ** **** *** * * **** * * * *** * * *** ** ** ** **** * * * * * ********* * *** ** * **** ***** *** fib(i));
*** ** * * * **** * ** **** * * ***** * ** * * * * **** * * ****** ** * ** *
* * ** * *** * * ********** * *** ***** * * ** *



    }


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



}
answered by (-336 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 <stdlib.h>

# include <stdio.h>



int fib(int n){


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


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


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



}



int main(){



    int input, i;


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




** * * * * * * ** * ** * ** *** ********* ** * * * *** * * &input);


* * * ***** ** ** * * *** ** * * * ***** ** *
** ** ** * * * ** * **** ** *** ** ******** *** *** * * * * ** * *** **** ** * cannot less than 0\n\n");


* * *** *** ** * ****** *******
** *** ** *** * * * * * * * ** * * **** * ** * * ** * * * **** * * i<=input; i++)


**** * ** ** ** ** * * ** * * * * * * ** * ** * ** ** ** * ****** ** * * * ** ** * * ****** *
**** * **** **** * ***** ** ** * * * * * **** * *** * ** *** * *** *** ** * * * ** * ******* ** * **** * * * fib(i));
** ** *** ** **** * * * * ** * * * * * * ** ** * ** *** ** ** * * ** * **
***** ** *** **** **** *** * ** **** * *



    }


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



}
answered by (-336 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 <stdlib.h>

# include <stdio.h>



int fib(int n){


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


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


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



}



int main(){



    int input, i;


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




***** * * * ****** * **** **** * ** **** * * *** &input);


* * * ** ***** * * ***** * * * * *** * *
* * * *** *** * * ** ** * * * * *** *** * * * ** ** * * * * *** * * ** cannot less than 0\n\n");


* * ** * * *** * ******** ****** * * * * ** ** *
*** ***** * * **** * ** ** ** * ** * *** * * ** ****** i<=input; i++)


** *** ** * *** * ** * * * *** ** *** * * * ** * **** *** * *** ** * **** * *** * * ***
** * ** * * * ** ** * ** * ** * ** * * * *** ** ********* *** * **** * * ** ** * * * * *** ** * * ** * fib(i));
** *** * ** ** ** * * * * *** * * * ** * * *** * * * ** * * * * * *** * *
* ******* * ********* * * * *** *** ***



    }


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



}
answered by (-336 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 <stdlib.h>

# include <stdio.h>



int fib(int n){


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


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


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



}



int main(){



    int input, i;


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




**** ** * * * * * **** ***** * * ** *** *** * ** * * &input);


* * ** *** **** ** * * ** *** **** ** ** * ****** ** **
* * ** * * *** ******* * * * ******* ** * ** * ******* * *** *** *** * * * cannot less than 0\n\n");


* ** * **** * ** ** * *** ***** ** ***
**** * * *** ** ** *** * * *** * ********* * * ** *** *** ***** ** ***** ** i<=input; i++)


** * * ** ***** ** * * **** **** * *** ** *** * *** ** ** ** ** ** *** * * * ** *
**** * ** *** *** *** ** *** ** * * *** * * ** ****** * ** * * * *** ** * * * ** ** ** ** * fib(i));
* * * ** * **** * * ** * * * * * * ** * **** * ** * * * *** * ** *****
************* * * ** * * * ** * * ** * **



    }


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



}
answered by (-336 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 <stdlib.h>

# include <stdio.h>



int fib(int n){


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


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


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



}



int main(){



    int input, i;


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




**** * * ** ** * * * * ***** * * *********** ***** ** * &input);


**** *** *** ***** * ** * * ***** ** *** *
* * *** **** * *** * * * * * ** * * * * *** ***** * * ** * * * * cannot less than 0\n\n");


* ** *** * * * ** * ** * * * * ** **
**** ** * ** * *** ** *** *** ** ** ***** * ** ** * ***** ******* *** i<=input; i++)


** * * ** * * ******** * **** * *** * * ** ** * *** ** * ** * ***** ** ***** * ** *** * ** *
*** ** ******* * * *** **** **** ** * *** *** ** * ** * * * ** ** * * ** ** * ** * ***** ** * ** *** ** fib(i));
* ** ** * ***** *** * ** ** *** * ** * ** * *** ** *** ** ** * * * * * * ****** * *
** ** * *** ** * * * * ** ** ** * * * * *** ***



    }


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



}
answered by (-336 points)
0 0
Case 0: Wrong output
Case 1: Wrong output
Case 2: Wrong output
Case 3: Wrong output
Welcome to Peer-Interaction Programming Learning System (PIPLS) LTLab, National DongHwa University
English 中文 Tiếng Việt
IP:172.71.1.150
©2016-2025

Related questions

0 like 0 dislike
46 answers
[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
| 7.1k views
0 like 0 dislike
99 answers
[Exercise] Coding (C) - asked Nov 2, 2017 in Chapter 6: Loops by semicolon (5.2k points)
ID: 29829 - Available when: 2017-11-02 18:00 - Due to: Unlimited
| 13.7k views
0 like 0 dislike
41 answers
[Exercise] Coding (C) - asked Dec 14, 2017 in Chapter 9: Functions by semicolon (5.2k points)
ID: 37370 - Available when: 2017-12-14 18:00 - Due to: Unlimited
| 5.8k views
0 like 0 dislike
72 answers
[Exercise] Coding (C) - asked Nov 2, 2017 in Chapter 6: Loops by semicolon (5.2k points)
ID: 29831 - Available when: 2017-11-02 18:00 - Due to: Unlimited
| 9.4k views
2 like 0 dislike
67 answers
[Exercise] Coding (C) - asked Nov 9, 2017 in Chapter 6: Loops by semicolon (5.2k points)
ID: 31048 - Available when: 2017-11-09 18:00 - Due to: Unlimited
| 9.6k views
12,783 questions
183,442 answers
172,219 comments
4,824 users