Fibonacci And LCM

CodeChefOpen on judge ↗

This time little Avani is interested in finding the LCM of the mth and nth Fibonacci numbers. She will provide you with two integers m and n and you have to help her by finding LCM(Fm , Fn) mod 109 + 7. In mathematics, Fibonacci numbers are the numbers defined by the following recurrence relation. Fn = Fn-1 + Fn-2 and F1 = F2 = 1 Input The first line of the input contains an integer T denotin

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