The Set Covering Problem.

The task is to find a minimal set of subsets of a set S which covers the
properties of all elements of the set S.

The program takes 1 parameter: the size of the set S.
