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

93 Answers

0 like 0 dislike
Hidden content!
#include<stdio.h>
int main()
{
int p;
* *** ** ** **** *
* * ** ** **** * * ***** * *** ***
    {
** ** * * ***** * * * ** ** *** ** ******* * * ** *** * *
    }
* *** * * * ** if(q==2)
    {
******** *** * * **** * * * * * * ** ** * * ** ** **
    }
** * * * * ** if(q==3)
    {
* ** *********** * * *** * **** * **** ** ** *** * * ******* *
    }
** ******* ** * * *** *** if(q==4)
    {
* * * **** * * ** * **** *** * * * * * ** ** * *** ** *
    }
* * * **** * *** ** * * if(q==5)
* *** * * **
*** * *** * *** **** ******* * ** ** ** ** * ** ** *** * *
* ** * * ****** * *
** * ** ** * ******* * * if(q==6)
* ** * ** *** *** ** *
* * * ** * ** * * * * * * * * **** * ** *** ** * **
* ** ** *** * ***** * **
* * * * * * ** *** * *** if(q==7)
**** * * *** *** **
* **** * * ** ** ***** *** * **** * *** * *** *** * * * * * *
**** ** ** ****** *** *
* ** * * ** ** ***** if(q==8)
***** *** * ***
* *** * ** **** *** ***** ** * * *** * * * * * *******
**** * ** *** * *
* *** **** * * * * * if(q==9)
** *** **** ** *** * **
** ** * ** **** ** * * ***** *** * *** *** ** *** * *** * * ** *
    }
* * * *** *** * ***** if(q==10)
* ***** ** * ** * **
** * *** * * * * **** ** **** * * **** *** ***********
* * ****** * * *** *
***** * ** ******* * *** if(q==11)
*** ** * *** * *
** * *** * * ***** * * ***** ********* *** *** * * *
    }
** *** *** ***** * * * if(q==12)
* **** ** ***** * *** ***
** **** *** * * * *** * ** *** * * *** *** * * * * ** ***
**** ** ** * * **** *
*** ** * * ** * * ** * ** *** 0;
}
answered by (-329 points)
0 0
prog.c: In function 'main':
prog.c:5:13: error: 'q' undeclared (first use in this function)
 scanf("%d",&q);
             ^
prog.c:5:13: note: each undeclared identifier is reported only once for each function it appears in
0 like 0 dislike
Hidden content!
#include <stdio.h>
#include <stdlib.h>

int main()
{
* * ** * *** * *** * a=0,b=1,c,d;
* * * * * * ** * * ** *** * ** * * ****
** ***** ** *** * * ** ** * * **
*** * ******** ** *** *
** * ** * * ** ** * ** * ********
* ***** ** * ***** * ******* *** * ** ** * * * ****
* * * * * * * ** * * * * * *** **** ** ** ** **
** ** ** ** * * * *** * ** **
* * *** * * *** *** * ** * * **
** * * ** *** ***** 0;
}
answered by (-498 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 *** ** ******

int number;

int GetFibonacciNum(int integer){

* * * * ** ***** * * * * * values for Fibonacci sequence
* ** ** * * ***** **** * * F[integer];
* ** * * * *** * **
* *** * * * ** * * ****
* ** * * ***** * * * i;
*** * * * **** *** F[integer]
* *** *** * *** **** **** *** **
* ***** * ** * ** * ***** ******** * * * ** * * * * *
*** ***** **** ** ****** *
* * ** * * **** ** * ** F[integer];
}
///
int main(){
******** ****** ** **** **** *
** **** * ** ** ***** * * &number);
*** *** ** * * * * ** ** **
* **** * *** * ****** = * *** ** *
* * *** ** **** *
* ******* ** ** * ** * * ***** **** number);

* ** * ** ** ** ** * ** 0;
}
answered by (-286 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()

{
* **** ** * ** input,n=0,F1=0,F2=1,FN;
* *** * **** *** ** * ** * ** ** ** *** **

** ** **** ** * ** * **** (n;n<input-1;n++)
* ** **** *** *
* * * ** * * * ** ******* * * ****** * **
* ***** ** *** * * ** **** * * * * *** * * *
**** ** ** * ** ** * * * ****** * ***** * ***
* ***** ** *** **
** * * ******* *** (input==0)
**** * * ** * *** ** *
** * * * * ** * **** *** ** ** * ** *** ** ** ** * * *
* * * * *
* * * **** * * * ** * * *** if (input==1)
**** ** ** * ** * * *
* ** **** * ** *** * ***** ** ***** ***** * **** ** ** ** ** *
    }
* ***** ** ** * *
    {
** * * * ** * * ** * *** ***** *** ********* ** * * * *
    }
* * * * * **** * ** ** ** * 0;

}
answered by (-249 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()
{
 int a,i=0,j=1,k,c=2;
* ** * ** * * ** *** * ***
 while(1){
*** * ** * * * * * * * **
* ** * * ** * *** * *** *
* *** ** * * ***** * ***

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


return 0;
}
answered by (-329 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 main()
{
*** * *** * ** ** * * * a,b,c,d,e;
* *** * * * * ***** *** * **
* * *** *** ** ** * * ** **** * * ** *** * ** ** *
    
* ** ** * *** * * ** * * * ******* **
*** * * * *** *** *
* * *** ***** * * * ** ** ** * *** ****** **
** ** * *** * * ****** ** * * **** * * **
** * * * * * ** * * * **** * * * * *** * * **
** ***** * * * * ** ** **** * **** ****
* ** * * **** *** *
*** ** * * * * * * * ** ** * * ** ** ** **
**** ** ** *** * * *** 0;
}
answered by (-249 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 * * * * *** *
int main()
{
* * * ***** * * * * ** i, n, t1 = 0, t2 = 1, nextTerm,a;

*** *** *** * ** ***** * **** &n);

* * * ** ** ** ** ** (i = 1; i <= n; ++i)
* * ***** * *** **
* **** * * ** * **** **** * ** **** * = t1 + t2;
* ** ** * *** ** * * * * ** ** ** * * * = t2;
* * * **** ** **** ** ** *** **** *** **** = nextTerm;
* ** * * *** ****
****** *** *** *** * **
** ** * * * ** * ** * ** * * * * * * * ***
* *** * * * ** 0;
}
answered by (-323 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()

{
    int n,i,count=2,first_term=0,second_term=1;
* * ***** ** ** ** * ** ** * * * * *

    if (n==0)
* *** ** ** ** *** ** ******* * *** * ** ** * ** **** **
    if (n==1)
* *** * * ** * * * ** **** **** ** ** * **** * * **
    else
    {
* *** * ** * * ** * ** ** * ** ****** (count;count<=n;count++)
** * * * * ** * ** * * * * ** ** **
*** * *** * * * **** ** ** ** * *** *** * ** ** ** * *** *** ** **** ***
** * * * ** * ** ** ** **** * * * *** * * ** ** * ** * ***** **** *
* **** *** * ** ** * * ** * ** ** ***** ** ** ** ** * ** **

** **** ******** *** **** * *** *** * **** **** ** ***** * *** * (count==(n))
** **** ** * ** ** * * ** * **** * * **** **** *** **** * * * *** ** * * * ***
**** * * * ** ** * * * * **** ** *** ***** ** ** ** ****** ** * ** *** * ********** ** * * *** ** ****** * ** **** ** **** ***
* ** ** ** ******** * ** * ** * ** ****** ** * * * ** ** ***** * ******* ** *** ** ** * **** ** * * ***** * * **
* * ***** ***** ** * ** ** * ** * * * ** * * * *** ******** * * * * * ** * ****** ** *****
* **** * * **** *** * * * ** * **** ** ***
    }
* *** *** ** * * * * *** ** * * *** * 0;
}
answered by (-249 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 main()
{
* ** ** * ***** *** *** ** a,b,c,d,i;
* ** * *** * * ***** * * *
** ** ** * ** * **** **** * ** * * * *** * **** ** ***
* ** * ** * * * * *** *** **
    {
* ** ** * * * *** ** *** * ***** ****** ** * *
*** * * * *** * * ** * * * *** ** *** **
* * **** * *** *** * * * * ** *** ** *

* * *** ** * *** * **** * *
** * ***** *** * * * * ********** * **
* ** * *** *** ** * * 0;
}
answered by (-258 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 *** *** ** * *
int main()
{
int a,b,cb,c0=0,c1=1;
* * *** * *** * ** *****
if(a==0) * * * ******* *
else if(a==1) *** * ****** ****
else {
*** * ****** ** * ** **** *** * * ****
**** *** * *** *
* ***** ** * * * * *** * ** *** * = c0+c1;
** ** **** ** **** *** * * ** * * ** * ** * = c1;
** ** ** * *** * *** * * * ***** * * ** **** = cb;
* * * ***** * ******** ** *
* * **** ****** * ** * * * *** * * ***
}
return 0 ;
}
answered by (-254 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
Welcome to Peer-Interaction Programming Learning System (PIPLS) LTLab, National DongHwa University
English 中文 Tiếng Việt
IP:172.71.255.125
©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
| 6.9k 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.3k 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.6k 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
| 9k 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.2k views
12,783 questions
183,442 answers
172,219 comments
4,824 users