Maximize Exercises in Workshops

Problem Statement

Maximize Exercises in Workshops Problem Description A teacher is organising a series of coding workshops using a collection of student-created exercises. She has prepared k exercises, and each exercise belongs to exactly one category, represented by an integer. Several exercises may share the same category. She will hold a sequence of workshops, one per day. The plan must satisfy all of the following: Every exercise used on a given day must belong to the same category . Each workshop uses a different category - no category may be used on two different days. The number of exercises used on each day after the first must be exactly double the number used on the previous day. The first day's workshop may use any positive number of exercises. She does not have to use every exercise. Exercises that do not fit the pattern simply go unused, and a category may be used only partially - if a day needs 8 exercises and the chosen category has 9, the remaining one is left over. Given the category of