HDU 4764 Stone（巴什博弈变形）

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

原创最新推荐文章于 2021-06-21 16:58:45 发布 · 639 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#ACM #博弈

博弈专栏收录该内容

7 篇文章

订阅专栏

本文介绍了一个简单的游戏胜负预测算法，通过计算特定条件下玩家的游戏策略，确定最终赢家。具体包括游戏规则说明、输入输出示例及核心算法实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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:

1 1
30 3
10 2
0 0

Sample Output:

Jiang
Tang
Jiang

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
using namespace std;
const int MAXN = 1000 + 10;
int n, m;
int SG[MAXN];
int vis[MAXN];
int main()
{
    while(scanf("%d%d", &n, &m)!=EOF)
    {   
        if(n == 0 && m == 0) 
            break;
        if((n-1) % (m+1) == 0) printf("Jiang\n");
        else printf("Tang\n");
    }
    return 0;
}