← All problemsSign in

Money Sums

CSESDynamic ProgrammingOpen on judge ↗

You have n coins with certain values. Your task is to find all money sums you can create using these coins. Input The first input line has an integer n: the number of coins. The next line has n integers x_1,x_2,\dots,x_n: the values of the coins. Output First print an integer k: the number of distinct money sums. After this, print all possible sums in increasing order. Constraints - 1 \le n

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

Sign in to chat with the tutor and save your progress.

Sign in to start