Fibonacci

CodeChefOpen on judge ↗

Sri has a list of all Fibonacci numbers modulo 10^13. This list is infinite, it starts with numbers 0 and 1. Each number in the list, apart from the first two, is a sum of the previous two modulo 10^13. That is, Sri's list is made from the Fibonacci numbers' list by replacing each number there by the remainder when divided by 10^13. Sri got interested in number f (0 ≤ f < 10^13) and now wants t

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