There are N number of possible drinks.(n1,n2…)
Has C number of fixed customers.
Every customer has fixed favourite set of drinks.
Bartender has to create least possible number of drinks
to suffice need of all the customers
Need help on this question. If anyone can provide the approach or code it would be helpful in C++