Good Luck in CET-4 Everybody! Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5488 Accepted Submission(s): 3530 Problem Description
巴什博弈: 一堆物品n个,最多取m个,最少取1个,最后取走的人获胜 分析:只要保证取玩最后剩m+1个,则必定胜利,所以构造m+1,只要n是 m+1的倍数,则先手必败,每次先手取玩,后手可取使得剩下的仍然是m+1的倍数,直到最后,剩下m+1个 Good Luck in CET-4 Everybody! Time Limit: 1000/1000 MS (Java/Others) Memo