Alice and Fibonacci

CodeChefOpen on judge ↗

Alice has n numbers with him.But he is only interested in the Fibonacci numbers as Alice thinks they are valuable.So, he wants to find how many distinct Fibonacci numbers he has with him.Help him finding it.Assume Fibonacci numbers start from 1. Input The first line contains the value of n. The next line contains n space separated integers, where the ith integer is A[i]. Output Print a single

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