zoukankan      html  css  js  c++  java
  • HDU-1729

    This game is a two-player game and is played as follows:

    1. There are n boxes; each box has its size. The box can hold up to s stones if the size is s.
    2. At the beginning of the game, there are some stones in these boxes.
    3. The players take turns choosing a box and put a number of stones into the box. The number mustn’t be great than the square of the number of stones before the player adds the stones. For example, the player can add 1 to 9 stones if there are 3 stones in the box. Of course, the total number of stones mustn’t be great than the size of the box.
    4.Who can’t add stones any more will loss the game.

    Give an Initial state of the game. You are supposed to find whether the first player will win the game if both of the players make the best strategy.
     

    Input
    The input file contains several test cases.
    Each test case begins with an integer N, 0 < N ≤ 50, the number of the boxes.
    In the next N line there are two integer si, ci (0 ≤ ci ≤ si ≤ 1,000,000) on each line, as the size of the box is si and there are ci stones in the box.
    N = 0 indicates the end of input and should not be processed.
     

    Output
    For each test case, output the number of the case on the first line, then output “Yes” (without quotes) on the next line if the first player can win the game, otherwise output “No”.
     

    Sample Input
    
    
    3 2 0 3 3 6 2 2 6 3 6 3 0
     

    Sample Output
    
    
    Case 1: Yes Case 2: No
    nim 游戏 参考其他人的代码
    #include #include #include using namespace std; int sg(int c, int s){ int t = sqrt(s); while(t*t + t >= s) t--; if(c > t) return s - c; else return sg(c, t); } int main(){ //freopen("data.in", "r", stdin); int n, c, s, cas = 0, flag; while(scanf("%d", &n), n){ printf("Case %d: ", ++cas); flag = 0; while(n--){ scanf("%d%d", &s, &c); flag ^= sg(c, s); } if(flag) printf("Yes "); else printf("No "); } return 0; }
  • 相关阅读:
    如何用VSCode手动编译Ace Editor
    libuv源码分析
    二叉平衡查找树---红黑树
    tcp滑动窗口与拥塞控制
    ceph架构剖析
    腾讯面试总结
    协程的实现原理
    dhcp协议交互报文
    libuv源码分析前言
    Protobuf使用规范分享
  • 原文地址:https://www.cnblogs.com/kuroko-ghh/p/9363380.html
Copyright © 2011-2022 走看看