Sweet Tooth

CodeChefOpen on judge ↗

Problem Description Hiraben owns a sweet shop. She starts an offer to make her sweets irresistible. Every sweet is numbered in an increasing order from 1 to N, and each of these that is produced at a number in the Fibonacci series is free of cost. Calculate the cost of sweets she gives away for free if her shop produced n sweets. Cost of a single sweet is also taken as input,C. Input Data Firs

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