F22 | 06 April 2026 | Problem Setting | Work Schedule

Problem 1: Problem Setting The Scenario: A school teacher has n different problem ideas and a total of m tags. Each problem has associated tags represented by a 2D array named tags, where tags[i][j] = 1 if problem i contains the jth tag, and tags[i][j] = 0 otherwise. Each problem also has a preparation cost represented by an array named cost of length n. It is guaranteed that for each of the m tags, there is at least one problem ...