摘要：
题意：现在有包括了Bob在内的N个小朋友，M种游戏卡片，Bob可以和其他人交换卡片，除了Bob，每个人的交换原则都是只给出自己拥有大于1的卡片，接受自己没有的卡片。问他最多有多少不同的卡片。 N<=10; M<=25; 思路：最大流，卡片流向玩家表示Bob付出卡片，玩家流向卡片，边数玩家给Bob卡片 阅读全文
posted @ 2018-12-27 14:11
nimphy
阅读(417)
评论(0)
推荐(0)
摘要：
We consider problems concerning the number of ways in which a number can be written as a sum. If the order of the terms in the sum is taken into accou 阅读全文
posted @ 2018-12-27 13:13
nimphy
阅读(249)
评论(0)
推荐(0)
摘要：
The Wall has down and the King in the north has to send his soldiers to sentinel. The North can be regard as a undirected graph (not necessary to be c 阅读全文
posted @ 2018-12-27 10:29
nimphy
阅读(307)
评论(0)
推荐(0)
浙公网安备 33010602011771号