Fibonacci Numbers

CodeChefOpen on judge ↗

Given $N$ find the nth fibonacci number. ###Input: - First line will contain $T$, number of testcases. Then the testcases follow. - Each testcase contains of a single line of input, integer $N$. ###Output: For each testcase, output in a single line answer given by modulo 100000007. ###Constraints - $1 \leq T \leq 200000$ - $1 \leq N \leq 100000000$ ###Sample Input: 1 5 ###Sample Output:

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