FIBONACCI

CodeChefOpen on judge ↗

You are given two numbers a and b. C is the bth fibonacci number, where the first fibonacci number is 0. You have to find the number(D) closest to C which is divisible by a. If there are multiple answers then the output is the smaller number. ###Input: The first line contains a. The next line contains b. ###Output: The output is a single integer D. ###Constraints - $2 \leq a \leq 300$ - $1

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