HDU 4764 Stone(巴什博奕)
2024-10-06 19:40:23
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2026 Accepted Submission(s):
1428
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.
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.
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.
line.
Sample Input
1 1
30 3
10 2
0 0
30 3
10 2
0 0
Sample Output
Jiang
Tang
Jiang
Tang
Jiang
Source
Recommend
我们可以把模型抽象一下
有$n-1$个石子,一个人最多拿$k$个,问最后谁赢
——》裸的巴什博奕
#include<cstdio>
#include<algorithm>
using namespace std;
const int MAXN=1e6+,INF=1e9+;
int main()
{
#ifdef WIN32
freopen("a.in","r",stdin);
#else
#endif
int x,y;
while(scanf("%d%d",&x,&y))
{
if(x==&&y==) break;
if( (x-)%(y+)== ) printf("Jiang\n");
else printf("Tang\n");
}
return ;
}
最新文章
- MySQL ROOT密码更改
- Python-基础练习题2
- WPF实现无边框窗体拖拽右下角▲ 改变窗体大小【framwork4.0】 谢谢大家关注
- poj 2342 Anniversary party 简单树形dp
- 存储过程&;Function
- Java实现Http服务器(三)
- C# 将MSMQ消息转换成Json格式 【优化】
- LaunchScreen.xib 设置启动图
- Row versus Set Processing, Surprise!(集合处理和单行处理数据的差异性)
- web页面接入QQ客服的方法
- Codeforces 842B Gleb And Pizza【几何,水】
- Unity Graphics(一):选择一个光照系统
- mysql修改用户密码命令
- 树莓派3B安装LEDE
- ChIP-seq 学习内容
- 火币网API文档——WebSocket API错误码
- java调用存储过程mysql
- 批处理(bat)的注释方法
- Codeforces Round #280 (Div. 2) A. Vanya and Cubes 水题
- Golang配置文件解析-oozgconf