In the Fibonacci sequence, each successive element is the sum of the two previous elements. Starting with 0 and 1, the next element is 0 + 1 = 1. The element after that is 1 + 1 = 2. The element after that is 1 + 2 = 3, and the one after that is 2 + 3 = 5, and so on. Given this declaration:
int p, q;
Provide a
forloop that prints this part of the Fibonacci sequence:
1 2 3 5 8
Your solution should consist of just a
forloop header and then an empty statement—nothing else. By the way, we recommend that you avoid using code like this for your real programs. This exercise is just for fun (fun for a hacker, anyway ☺).
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.