HDU 4764 Stone (巴什博弈变形)

最新推荐文章于 2021-06-21 16:58:45 发布

AC_Dreameng

最新推荐文章于 2021-06-21 16:58:45 发布

阅读量3.3k

点赞数

分类专栏： HDU ACM_博弈 ACM_博弈_巴什（Bash）博弈 ACM_HDU刷题录文章标签： HDU4764 Stone 巴什博弈

本文链接：https://blog.csdn.net/hurmishine/article/details/51448412

版权

ACM_HDU刷题录同时被 3 个专栏收录

351 篇文章 98 订阅

订阅专栏

HDU

153 篇文章 0 订阅

订阅专栏

ACM_博弈

10 篇文章 0 订阅

订阅专栏

Stone

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1297 Accepted Submission(s): 916

Problem Description

Tang and Jiang are good friends. To decide whose treat it is for dinner, they are playing a game. Specifically, Tang and Jiang will alternatively write numbers (integers) on a white board. Tang writes first, then Jiang, then again Tang, etc... Moreover, assuming that the number written in the previous round is X, the next person who plays should write a number Y such that 1 <= Y - X <= k. The person who writes a number no smaller than N first will lose the game. Note that in the first round, Tang can write a number only within range [1, k] (both inclusive). You can assume that Tang and Jiang will always be playing optimally, as they are both very smart students.

Input

There are multiple test cases. For each test case, there will be one line of input having two integers N (0 < N <= 10^8) and k (0 < k <= 100). Input terminates when both N and k are zero.

Output

For each case, print the winner's name in a single line.

Sample Input

Sample Output

  
  
   
   Jiang
Tang
Jiang

Source

2013 ACM/ICPC Asia Regional Changchun Online

原题链接:http://acm.hdu.edu.cn/showproblem.php?pid=4764

题意:有一个数字 n ,两人轮流选数相加(范围为[1,k]),当某人加上所选数字时,和大于等于 n 的时候则失败.

判断谁能赢得比赛.

要想赢得比赛,报了最后一个数后和必须为 n-1,此时边=便转变为总数为n-1纳什博弈!

AC代码:

#include <iostream>
using namespace std;
int main()
{
    int n,k;
    while(cin>>n>>k)
    {
        if(n==0&&k==0)
            break;
        if((n-1)%(k+1))
            cout<<"Tang"<<endl;//1
        else
            cout<<"Jiang"<<endl;
    }
    return 0;
}