HDU4764 Stone (巴什博奕)_tang and jiang are good friends. to decide whose t-CSDN博客

本文链接：https://blog.csdn.net/nka_kun/article/details/78560022

Stone

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

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

题意：每次最少拿一个，最多拿k个，最先拿够n失败。

思路：巴什博奕

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<queue>
#include<stack>
#include<cstring>
#include<string>
#include<vector>
#include<cmath> 
#include<map>
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
typedef long long ll;
const int maxn = 2e5+5;
const int ff = 0x3f3f3f3f;

int n,k;

int main()
{
	while(cin>>n>>k,n+k)
	{
		n--;
		if(n<= k)
		{
			if(n == 0)
				cout<<"Jiang"<<endl;
			else
				cout<<"Tang"<<endl;
			continue;
		}
		if(n%(k+1) == 0)
			cout<<"Jiang"<<endl;
		else
			cout<<"Tang"<<endl;
	}
	return 0;
}