A Simple Game（巴什博弈和尼姆博弈）

A Simple Game

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/65535 K (Java/Others)
Total Submission(s): 707 Accepted Submission(s): 419

Problem Description

Agrael likes play a simple game with his friend Animal during the classes. In this Game there are n piles of stones numbered from 1 to n, the 1st pile has M₁ stones, the 2nd pile has M₂ stones, ... and the n-th pile contain M_n stones. Agrael and Animal take turns to move and in each move each of the players can take at most L₁ stones from the 1st pile or take at most L₂ stones from the 2nd pile or ... or take L_n stones from the n-th pile. The player who takes the last stone wins.

After Agrael and Animal have played the game for months, the teacher finally got angry and decided to punish them. But when he knows the rule of the game, he is so interested in this game that he asks Agrael to play the game with him and if Agrael wins, he won't be punished, can Agrael win the game if the teacher and Agrael both take the best move in their turn?

The teacher always moves first(-_-), and in each turn a player must takes at least 1 stones and they can't take stones from more than one piles.

Input

The first line contains the number of test cases. Each test cases begin with the number n (n ≤ 10), represent there are n piles. Then there are n lines follows, the i-th line contains two numbers M_i and L_i (20 ≥ M_i > 0, 20 ≥ L_i > 0).

Output

Your program output one line per case, if Agrael can win the game print "Yes", else print "No".

Sample Input

  
  

   
   2
1
5 4
2
1 1
2 2
  
  

Sample Output

  
  

   
   Yes
No
  
  

Author

Agreal@TJU

Source

HDU 2007 Programming Contest - Final

Recommend

lcy

题意：给出n组数据，每组数据表示这堆石子共有i个，每次最多取j个，问若两个人都按最优的方法取，谁能取胜（即最后取完石子的人）

 

题解：巴什博弈（Bash Game)和尼姆博弈(Nim Game)运用到一起去了。每一堆石头的取法有着巴什博弈的特性，可以通过if(n%(m+1)) 来判断。解题的思路是先通过巴什博弈的解法，将每一堆要解决的子问题先解决掉后，就自然地转化成了尼姆博弈的问题了。尼姆博弈的主要解决手段是通过异或运算（^或xor）来处理的。

 

#include<iostream>
using namespace std;
int main()
{
    int nc,n,a,b;
    cin>>nc;
    while(nc--)
    {
        cin>>n;
        int ans=0;
        while(n--)
        {
            cin>>a>>b;
            ans=ans^(a%(b+1));
        }
        puts(ans?"No":"Yes");
    }
    return 0;
}