Lalith Dosa

CodeChefOpen on judge ↗

Problem Statement This problem is present in SPOJ platform and uploaded by the same author . Lalith is going to have dinner and he has N dosas in front of him with their prices represented by sequence of integers a1,a2,a3...an. And he has decided to eat in a different manner . You are free to replace the price of any dosa with any positive integer. How many prices(integers) must be replaced to

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