Operations

CodeChefOpen on judge ↗

Munchi loves Fibbonaci Series. Fibbonaci series is defined as follows- f(0) = 0; f(1) = 1; For i > 1 : f(i) = f(i - 1) + f(i - 2) Munchi defines a function Fun(r,k) as- if(P(r)Fun(r,k)=1; else ->Fun(r,k)=0; Where P(r) is the minimun numbers of fibbonaci numbers that can sum-up to r. Example: P(10)=2 i.e. 2+8=10 (also 5+3+2=10, but minimum is 2) Now Munchi gives his friend BlackHammer two

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