HDU4764 Stone 简单博弈

题目链接：HDU4764

Stone

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

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
  
  

 

题意：从0开始每次加1到k，一直到n-1，如果没有数可加就输了。问谁会赢。

题目分析：等价于一个堆中每次拿走1到k的经典博弈题，看n-1等不能整除k+1即可。

//
//  main.cpp
//  HDU4764
//
//  Created by teddywang on 2016/9/2.
//  Copyright © 2016年 teddywang. All rights reserved.
//

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