[博弈论]Stone

最新推荐文章于 2024-03-31 10:57:17 发布

dnldnth

最新推荐文章于 2024-03-31 10:57:17 发布

阅读量750

点赞数

分类专栏： ACM 文章标签： Hdu

本文链接：https://blog.csdn.net/wu_yihao/article/details/12649169

版权

ACM 专栏收录该内容

62 篇文章 0 订阅

订阅专栏

Stone

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

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

Recommend

liuyiding

一道比较简单的博弈论

相当于加数，加到N则输

首先分析必胜状态，显然n-1是必胜状态，其他必胜状态都是要向它转化的。

n-1-k ~ n-2是必输状态。

n-1-2k ~ n-2-k 是必胜状态。

……

观察发现

[n-1-pk-k , n-1-pk]这个区间，有k+1个元素，每个这种区间的最后一个元素，即对k+1取模等于1的这个元素对应的状态都是必胜态。

另外当1<n<=k的时候，显然是必胜态。而n=1是必败态。所以还需要特判。

#include <cstdio>

int main()
{
//    freopen("stone.in","r",stdin);
//    freopen("stone.out","w",stdout);

    while (1)
    {
        int n,k;
        scanf("%d%d",&n,&k);
        if (n == 0 && k == 0)
            break;
        if (n < k)
        {
            if (n == 1)
                printf("Jiang\n");
            else
                printf("Tang\n");
        }
        else
        {
            if (n % (k+1) == 1)
                printf("Jiang\n");
            else
                printf("Tang\n");
        }
    }

    return 0;
}