码代码的猿猿

2维的SG函数。。。2*2是必败状态

S-Nim Time Limit: 1000MS   Memory Limit: 32768KB   64bit IO Format: %I64d & %I64u [Submit]   [Go Back]   [Status]   Description Arthur and his sister Caroll have been

啥都不说了。。。 Fliping game Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1106    Accepted Submission(s): 762 Problem Description

和NIM博弈是一模一样的 Game Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 148    Accepted Submission(s): 116 Problem Description Here

C. Fox and Card Game time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Fox Ciel is playing a card game with he

将所有的圆化成树,然后就可以转化成树上的删边博弈问题.... Circles Game Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 881    Accepted Submission(s): 255 Pr

如果最后走的那个人奇偶两堆里都没有取完,则这个人是必胜的,另一个人想要赢就一定要把某一堆取完 判断k的奇偶性和最后一步是谁走,分类讨论 C. The Game Of Parity time limit per test 1 second memory limit per test 256 megabytes input stand