Strange Fibonacci

CodeChefOpen on judge ↗

Chef has list of all Fibonacci Numbers but in modulo 1013. This list in infinite. We know that Fibonacci sequence starts with 0 and 1. So in this list each number apart from first two, is sum of previous two numbers modulo 1013. ex : (a+b)mod 1013. So beginning of the list looks like : 0, 1, 1, 2, 3, 5, 8, 13, 21, ... Now you're given an integer n, find first occurrence of n in the given lis

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