Smash The Stack - IO - Level 02

Only slightly more complex than the first challenge. To solve level 2, do the following:

cd /levels

The output will give you a number sequence, and to solve the problem you need to enter a few of the elements all joined together. Most math students will recognize the Fibonacci Sequence in a heartbeat, summarized as:

F(n) = F(n-2) + F(n-1)

Or more easily, add the previous two numbers to get the current number. I.e. 1, 1, 2, 3, 5, 8, 13, 21, etc.

Find the requested numbers and plug them in as one long string to solve this.

./level02 **longstringofnumbers**
Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 License