首页 > ACM题库 > HDU-杭电 > HDU 1851 A Simple Game-博弈论-[解题报告] C++
2013
12-23

HDU 1851 A Simple Game-博弈论-[解题报告] C++

A Simple Game

问题描述 :

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 M1 stones, the 2nd pile has M2 stones, … and the n-th pile contain Mn stones. Agrael and Animal take turns to move and in each move each of the players can take at most L1 stones from the 1st pile or take at most L2 stones from the 2nd pile or … or take Ln 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.

输入:

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 Mi and Li (20 ≥ Mi > 0, 20 ≥ Li > 0).

输出:

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

样例输入:

2
1
5 4
2
1 1
2 2

样例输出:

Yes
No

#include<stdio.h>
int main()
{
    int T;
    int i,n;
    int ans,m,l;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        ans=0;
        for(i=1;i<=n;i++)
        {
            scanf("%d%d",&m,&l);
            ans=ans^(m%(l+1));
        }    
        if(ans==0)  printf("Yes\n");//后取的人胜 
        else   printf("No\n");//先取的人胜 
    }    
    return 0;
}

解题报告转自:http://www.cnblogs.com/kuangbin/archive/2011/08/29/2158950.html


  1. 这道题目的核心一句话是:取还是不取。
    如果当前取,则index+1作为参数。如果当前不取,则任用index作为参数。