2-SAT
文章平均质量分 89
nka_kun
ACMer
展开
-
CodeChef - VRTXCOVR
All submissions for this problem are available. You are given an undirected graph G = (V, E) containing N nodes and M edges. The nodes are numbered from 1 to N. A subset C of V is a vertex cover if fo...原创 2018-10-13 10:27:17 · 286 阅读 · 0 评论 -
POJ - 3683 Priest John's Busiest Day
Priest John’s Busiest Day Time Limit: 2000MS Memory Limit: 65536K Special Judge Description John is the only priest in his town. September 1st is the John’s busiest day in a year because there is an ...原创 2018-10-13 10:32:52 · 190 阅读 · 0 评论 -
POJ - 3648 Wedding
Wedding Time Limit: 1000MS Memory Limit: 65536K Special Judge Description Up to thirty couples will attend a wedding feast, at which they will be seated on either side of a long table. The bride and ...原创 2018-10-13 10:40:05 · 194 阅读 · 0 评论