A game题解(博弈论)

题目网址：Problem - 1543 (nefu.edu.cn)
Tony and Macle are good friends. One day they joined a birthday party together. Fortunately,
they got the opportunity to have dinner with the princess, but only one person had the chance. So
they decided to play a game to decide who could have dinner with the princess.
The rules of the game are very simple. At first, there are n sticks. Each of exactly m meters in
length. Each person takes turns. For one move the player chooses just one stick and cut it into
several equal length sticks, and the length of each stick is an integer and no less than k. Each
resulting part is also a stick which can be chosen in the future. The player who can't make a move
loses the game ,thus the other one win.
Macle make the first move.

Input

the first line contains tree integer n,m,k(1 <= n,m,k <= 10^9).

Output

print 'Macle' if Macle wins or 'Tony' if Tony wins,you should print everything without quotes.

Sample Input

1 15 4

Sample Output

Macle

Hint

第2组：
4 9 5
Tony

思路：

由于每根木棍都相等，所以sg(m)都一样，所以当n为偶数时，n个值异或为o，Macle必败。

当n为奇数时，只剩一个sg(m),用了sg模板会超时，只能手动分析了。

n为奇数时的答案和n=1时答案一样，我们只分析一根木棍，对于一根木棍，只要他能分段，他就一定能一次分到不能再分的段数，所以枚举段数（2，m/k）,只要找到一个可以分得段数，Macle赢。

注意：可能是数据问题，枚举段数从大到小枚举，从小到大会超时。

代码：

#define _CRT_SECURE_NO_WARNINGS
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include