Fibonacci sequence#2031

Fibonacci sequence

1 Sekunde

128 Megabyte

Sehr leicht

One integer $n$ is given. Print the first $n$ elements of the Fibonacci sequence:

$f (1) = 1$ f(1) = 1,
$f (2) = 1$ f(2) = 1,
$f (k) = f (k - 1) + f (k - 2)$ f(k) = f(k - 1) + f(k - 2) for $k = 3, 4, \dots$ k = 3, 4, \ldots

Eingabe

One integer $n$ ( $2 \leq n \leq 31$ 2 \le n \le 31).

Print the first $n$ elements of the Fibonacci sequence, each on a separate line.

Beispiel 1

Loading

f (1) = 1

f (2) = 1

f (k) = f (k - 1) + f (k - 2)

k = 3, 4, \dots

2 \leq n \leq 31