这篇博客讲述了Alice和Bob玩的一个石头游戏，两人轮流从两堆石头中按照一定规则拿走石头，先无法操作的人输。博客讨论了如何确定在最优情况下谁会获胜，并提到了另外两道竞赛题目——D - National Railway和B - Increasing Triples，分别涉及最短路径和组合计数问题。
Alice and Bob
Alice and Bob like playing games. There are two piles of stones with numbers {n}n and {m}m. Alice and Bob take turns to operate, each operation can take away {k}(k>0)k(k>0) stones from one pile and take away s \times k(s \geq 0)s×k(s≥0) stones from another pile. Alice plays first. The person who cannot perform the operation loses the game.
Please determine who will win the game if both Alice and Bob play the game optimally.
input
The first line contains an integer T(1 \le T \le 10^4)T(1≤T≤10
4
) denotes the total number of test cases.
Each test case contains two integers n,m(1 \le n,m \leq 5 \times 10^3)n,m(1≤n,m≤5×10
3
) in a line, indicating the number of two piles of stones.
o
最低0.47元/天 解锁文章
143
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
