Kattis - multiplicationgame Multiplication Game 博弈因子相乘是否等于N

最新推荐文章于 2023-02-23 22:59:53 发布

深海沧澜夜未央

最新推荐文章于 2023-02-23 22:59:53 发布

阅读量344

点赞数

分类专栏： Kattis ACM_博弈论 ACM_数字处理与数论

本文链接：https://blog.csdn.net/deepseazbw/article/details/81281514

版权

本文介绍了一种Alice和Bob在数学课上发明的乘法游戏。游戏开始时设定目标整数N（N≥2）和M=1。双方轮流选择N的一个质因数p，将M乘以p。若某一方通过操作使M等于N，则该方获胜；若M超过N，则游戏平局。给定输入案例，分析并确定在最优策略下谁会获胜或游戏是否平局。

摘要由CSDN通过智能技术生成

Alice and Bob are in their class doing drills on multiplication and division. They quickly get bored and instead decide to play a game they invented.

The game starts with a target integer N≥2, and an integer M=1. Alice and Bob take alternate turns. At each turn, the player chooses a prime divisor p of N, and multiply M by p. If the player’s move makes the value of M equal to the target N, the player wins. If M>N, the game is a tie.

Assuming that both players play optimally, who (if any) is going to win?

Input
The first line of input contains T (1≤T≤10000), the number of cases to follow. Each of the next T lines describe a case. Each case is specified by N (2≤N≤231−1) followed by the name of the player making the first turn. The name is either Alice or Bob.

Output
For each case, print the name of the winner (Alice or Bob) assuming optimal play, or tie if there is no winner.

Sample Input 1 Sample Output 1
10
10