FilesExpand file tree

 master

/

FibToN.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

33 lines (27 loc) · 908 Bytes

 master

/

FibToN.java

Top

File metadata and controls

• Code
• Blame

33 lines (27 loc) · 908 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

package Others;

import java.util.Scanner;

/**

* Fibonacci sequence, and characterized by the fact that every number

* after the first two is the sum of the two preceding ones.

* <p>

* Fibonacci sequence: 0, 1, 1, 2, 3, 5, 8, 13, 21,...

* <p>

* Source for the explanation: https://en.wikipedia.org/wiki/Fibonacci_number

*/

public class FibToN {

public static void main(String[] args) {

//take input

Scanner scn = new Scanner(System.in);

int N = scn.nextInt();

// print all Fibonacci numbers that are smaller than your given input N

int first = 0, second = 1;

scn.close();

while (first <= N) {

//print first fibo 0 then add second fibo into it while updating second as well

System.out.println(first);

int next = first + second;

first = second;

second = next;

}

}

}