Am I a Fibonacci Number
Read problems statements in Russian here The Head Chef has been playing with Fibonacci numbers for long . He has learnt several tricks related to Fibonacci numbers . Now he wants to test his chefs in the skills . A fibonacci number is defined by the recurrence : f(n) = f(n-1) + f(n-2) for n > 2 and f(1) = 0 and f(2) = 1 . Given a number A , determine if it is a fibonacci number. Input - The
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.
Sign in to chat with the tutor and save your progress.
Sign in to start