hdu 4764 Stone(巴什博弈)
来源:互联网 发布:java用户角色权限 编辑:程序博客网 时间:2024/05/18 01:43
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
简单博弈!
分析题目,数目总共n个,两个人都只能拿1~k个,那么可以保证无论先手第一次拿多少,后手拿了一次之后第一轮总共拿了k+1个,只要n-1是k+1的倍数,那么先手无论如何都可以赢,反之就会输,代码如下:
#include<iostream>using namespace std;int main(){ int n,k; while(cin>>n>>k) { if(n==0&&k==0) break; n--; k++; //每次先手在1~k之内取任意数,后手都能保持这一轮取的数字为k+1 if(n%k==0) //先手取到n-1则先手败 cout<<"Jiang"<<endl; else //否则先手赢 cout<<"Tang"<<endl; } return 0;}
- hdu 4764(stone) 巴什博弈
- hdu 4764 Stone(巴什博弈)
- HDU 4764 Stone (巴什博弈)
- HDU 4764 Stone (巴什博弈变形)
- HDU 4764 Stone 巴什博弈
- HDU-4764-Stone 【巴什博弈】
- HDU 4764 Stone(巴什博弈变形)
- HDU 4764(Stone) 巴什博弈变形 Java
- hdu 4764 Stone(博弈)
- HDU 4764-Stone(博弈)
- HDU 4764 Stone(博弈)
- HDU 4764 Stone(简单博弈)
- HDU 4764 Stone(博弈+推理)
- hdu4764 Stone 巴什博弈
- hdu4764 Stone 巴什博弈
- [巴什博弈] HDU 2149 Public Sale & HDU 1847 Good Luck in CET-4 Everybody! & HDU 4764 Stone
- HDOJ 4764 - Stone 巴什博弈模板题...
- HDU 4387 Stone Game 博弈
- python 字典(dict)按键和值排序
- spark常用函数:transformation和action
- 关于CGImageCreateWithImageInRect
- POJ1979 Red and Black
- [LeetCode]Minimum Depth of Binary Tree
- hdu 4764 Stone(巴什博弈)
- jzoj 1352. 【2011.12.24普及模拟】游荡的奶牛 解题报告
- 关于Mybatis的Batch模式性能测试及结论
- python 结巴分词(jieba)学习
- JAVA学习代码——单例模式
- 觉得对我这种随便起变量名的人有很大帮助的一篇文章
- GOF之观察者模式(一)
- PHP_Memcache函数详解
- centos 软件包冲突,无法安装php-mysql扩展