|
|
back to boardany hints plzzzz Lamest O(2^K) is enough here. Act greedy. At each iteration select such team X, that if X in contest, then the number of teams can't attend contest is minimal. Remove such teams that have common members with X from the list. |
|
|