Another Fibonacci

CodeChefRating 2742Open on judge ↗

Apurva is obsessed with Fibonacci numbers. She finds Fibonacci numbers very interesting. Fibonacci numbers can be defined as given below. Fib(1) = 1 , Fib(2) = 1. Fib(n) = Fib(n-1) + Fib(n-2) for n > 2 . Given a set S having N elements and an integer K, She wants to find out the value of FIBOSUM(S). Where sum(s) represents the sum of elements in set s. Note that values might b

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