Multisets (1)

Write a program that, given two numbers n and x, prints all the
multisets that can be made up with {1, …, n}, in such a way that every
number appears at most x times.

Input

Input consists of a natural number n > 0, followed by a natural number
x > 0.

Output

Print all the multisets that can be made with {1, …, n}, using each
number at most x times. The numbers inside each multiset must appear in
non-decreasing order.

Information about the checker

You can print the solutions to this exercise in any order.

Problem information

Author: Unknown
Translator: Salvador Roura

Generation: 2026-01-25T11:16:22.454Z

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