#C14527. Fibonacci Sequence Generation

    ID: 44186 Type: Default 1000ms 256MiB

Fibonacci Sequence Generation

Fibonacci Sequence Generation

This problem asks you to generate the Fibonacci sequence with n elements. The Fibonacci sequence is defined as follows:

\(F_0=0, F_1=1,\)

and for \( n \geq 2 \), \( F_n = F_{n-1} + F_{n-2} \).

You are required to read an integer \(n\) from stdin and output the first \(n\) numbers of the Fibonacci sequence to stdout separated by a single space.

inputFormat

The input consists of a single integer \(n\) (\(0 \leq n \leq 10^5\)). This integer is provided via stdin.

outputFormat

Output the first \(n\) numbers of the Fibonacci sequence in order. The numbers should be separated by a single space, with no extra spaces at the beginning or end.

## sample
1
0

</p>