海绵的博客

竞赛虐我千百遍,我待竞赛如初恋。 Never Give Up!!!

Vertex Cover CodeChef - VRTXCOVR

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...

2018-10-11 09:37:21

阅读数:36

评论数:0

poj 3207 Ikki's Story IV - Panda's Trick

Description liympanda, one of Ikki’s friend, likes playing games with Ikki. Today after minesweeping with Ikki and winning so many times, he is tire...

2018-10-09 20:32:39

阅读数:21

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭