Exchanging Money

CodeChefOpen on judge ↗

There are $N$ types of money denomination in your country having values $a_1, a_2, ...,a_n$. You went to a shop to buy a product worth $P$ units, predict whether is it possible to complete the purchase or not (You and the shopkeeper can choose notes of each denomination any number of times). You need to process $Q$ queries for this. Print "YES" if it is possible to complete the purchase, else prin

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