Chef and Amazingness of Numbers
Chef defined amazingness of a number n as follows. Let array a denote the decimal representation of n. amazingness of n is defined by following pseudo code. amazingness(a) { set s; int ans = 0; for ( int i = 0; i n counting from most signficant digit (left to right). if (val not present in set s before) { ans += val; add val to set s } } } return ans; } Given two integers L, R. Find out t
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