CJCoding With Joseph

Fibonacci First N Terms

Read an integer N (N >= 1), then print the first N terms of the Fibonacci sequence on one line, separated by single spaces. The sequence starts 0, 1, and each later term is the sum of the previous two.

Example (N = 8):
0 1 1 2 3 5 8 13

Expected Output:

0 1 1 2 3 5 8 13
Topics:
Loops
๐Ÿ“ฅ Auto-Input:
8\n
This input is automatically fed to your program's stdin
Code Editor
1
Tab to indent ยท Ctrl+Enter to run ยท Ctrl+Space to expand shortcuts (p, fori)

Your Output

Run your code to see the output here...

Test Cases

Run your code to see test case results.