Блог пользователя code_overlord

Автор code_overlord, 10 лет назад, По-английски

I need some help with a problem.

You are given a set S and a list L of subsets of S. L need not contain all subsets of S. Is it possible to pick some subsets from L such that they are pairwise disjoint and their union is S?

Note: It is not important to find those subsets. What is important is to be able to determine whether it is possible or not.

  • Проголосовать: нравится
  • -11
  • Проголосовать: не нравится

»
10 лет назад, # |
Rev. 3   Проголосовать: нравится +3 Проголосовать: не нравится

This is related to a problem from the December Long Challenge.