zoukankan      html  css  js  c++  java
  • 8.2.8 A Simple Game

    A Simple Game

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

    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 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.
     

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

    nim游戏,只不过每一个sg函数 变成了 Li % (mi+1)

    http://www.cnblogs.com/cssystem/p/3204826.html(关于sg函数的详解)

     1 #include <cmath>
     2 #include <cstdio>
     3 #include <algorithm>
     4 #include <cstring>
     5 #include <string>
     6 #include <cstdlib>
     7 using namespace std;
     8 
     9 const int maxn=210;
    10 int n,T,ans,m,l;
    11 
    12 void close()
    13 {
    14 exit(0);
    15 }
    16 
    17 
    18 void init()
    19 {
    20     scanf("%d",&T);
    21     while (T--)
    22     {
    23         scanf("%d",&n);
    24         ans=0;
    25         ans=0;
    26         for (int i=1;i<=n;i++)
    27         {
    28             scanf("%d %d",&m,&l);
    29             ans=ans ^ (m % (l+1));
    30         }
    31         if (ans==0)
    32             printf("Yes
    ");
    33         else
    34             printf("No
    ");
    35     }
    36 }
    37 
    38 int main ()
    39 {
    40     init();
    41     close();
    42     return 0;
    43 }
  • 相关阅读:
    用Premiere如何将带Alpha透明通道的视频文件压缩为同效果mp4文件
    日系插画绘制技巧个人整理
    VSCode个人推荐插件
    34行前端代码让你在浏览器可以玩本地贪吃蛇
    Latex+WinEdit安装配置教程
    Adobe Acrobat Pro DC 2019&2020激活方法
    windows下安装caffe (cuda10.0,anaconda3,python3.6→python2.7,vs2015→vs2013)
    Excel小技巧整理(持续更新)
    window + office 激活方法(不提供下载)
    Python爬虫初探
  • 原文地址:https://www.cnblogs.com/cssystem/p/3212553.html
Copyright © 2011-2022 走看看