Chef and Fibonacci

CodeChefOpen on judge ↗

Problem Statement A Fibonacci series is defined as f(0) = 0 , f(1) = 1 and f(i) = f(i-1) + f(i-2) for i>1 . Gcd of 2 numbers is the greatest common divisor of the 2 numbers. In this problem problem you will be given 2 numbers a and b and you are supposed to find f ( gcd(a,b) ) mudulo 10^9+7 . Input Format The first line contains an integet T which denotes the number of test cases . Then T lin

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