Chef-Land Antiques
CodeChefOpen on judge ↗
The city of Chef-Land holds a coin collecting competition in which the participant with the greatest number of antique coins wins the competition. Daisy took part a number of times but never won. This year, she wants to win at any cost so she came up with an idea to secretly borrow coins from her friends. She knows the minimum number of coins needed to win is $N$ from her past experiences. She has
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.
Sign in to chat with the tutor and save your progress.
Sign in to start