- 最後登錄
- 2024-3-12
- 在線時間
- 0 小時
- 註冊時間
- 2007-8-8
- 閱讀權限
- 20
- 精華
- 0
- UID
- 2043811
- 帖子
- 220
- 積分
- 456 點
- 潛水值
- 13981 米
| 本帖最後由 飄飄酷熱降龍 於 2011-11-18 06:38 PM 編輯
Color each element of Si with one of two colors, red or blue, such that each subset
Si contains at least one red and at least one blue element.
Require: A set of sets S = {S1, S2, . . . , Sk}, each containing exactly r elements.
Ensure: If there exists the program outputs the coloring method;
otherwise output nothing.
input file format: Each line is the content of a set, start from S1. In the example ... |
|