Equal sums (3)

Write a program that, given a natural number s and n natural numbers
x₁, …, x_(n), prints all the subsets (maybe with repeated numbers, but
using every x_(i) at most once) whose sum is exactly s.

Input

Input consists of a natural number s, followed by a number n > 0,
followed by x₁, …, x_(n).

Output

Print all the subsets whose sum is s that can be made up with
x₁, …, x_(n).

Information about the checker

You can print in any order both the solutions and the elements inside
each solution.

Hint

For this exercise, a very simple algorithm can be too slow.

Problem information

Author: Unknown
Translator: Carlos Molina

Generation: 2026-01-25T09:59:01.965Z

© Jutge.org, 2006–2026.
https://jutge.org
