| | | |

2019年2月21日

PAT A1150 Travelling Salesman Problem （25 分）——图的遍历

摘要： The "travelling salesman problem" asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shor 阅读全文

posted @ 2019-02-21 14:59 tccbj 阅读(373) 评论(0) 推荐(0)

PAT A1149 Dangerous Goods Packaging （25 分）——set查找

摘要： When shipping goods with containers, we have to be careful not to pack some incompatible goods into the same container, or we might get ourselves in s 阅读全文

posted @ 2019-02-21 14:02 tccbj 阅读(138) 评论(0) 推荐(0)

PAT A1148 Werewolf - Simple Version （20 分）——暴力遍历，负负得正

摘要： Werewolf（狼人杀） is a game in which the players are partitioned into two parties: the werewolves and the human beings. Suppose that in a game, player #1 阅读全文

posted @ 2019-02-21 11:01 tccbj 阅读(205) 评论(0) 推荐(0)