Powers

CodeChefOpen on judge ↗

Given $N$, calculate the $N+1$th, $N$th and $N-1$th Fiboncacci numbers. HINTS: - Fibonacci series: $1,1,2,3,5,8,13,.......$ - fib(n) = fib(n-1) + fib(n-2) - Print results $mod$ $10^9 + 7$ ###Input: - One integer $N$ ###Output: - 3 lines containing $N+1$th, $N$th and $N-1$th Fibonacci numbers respectively $mod$ $10^9 + 7$ ###Sample Input: 5 ###Sample Output: 8

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI