HDU 3951 Coin Game
来源:互联网 发布:java多线程售票系统 编辑:程序博客网 时间:2024/06/04 23:27
After hh has learned how to play Nim game, he begins to try another coin game which seems much easier.
The game goes like this:
Two players start the game with a circle of n coins.
They take coins from the circle in turn and every time they could take 1~K continuous coins.
(imagining that ten coins numbered from 1 to 10 and K equal to 3, since 1 and 10 are continuous, you could take away the continuous 10 , 1 , 2 , but if 2 was taken away, you couldn't take 1, 3, 4, because 1 and 3 aren't continuous)
The player who takes the last coin wins the game.
Suppose that those two players always take the best moves and never make mistakes.
Your job is to find out who will definitely win the game.Input The first line is a number T(1<=T<=100), represents the number of case. The next T blocks follow each indicates a case.
Each case contains two integers N(3<=N<=10 9,1<=K<=10). Output For each case, output the number of case and the winner "first" or "second".(as shown in the sample output) Sample Input Sample Output
The game goes like this:
Two players start the game with a circle of n coins.
They take coins from the circle in turn and every time they could take 1~K continuous coins.
(imagining that ten coins numbered from 1 to 10 and K equal to 3, since 1 and 10 are continuous, you could take away the continuous 10 , 1 , 2 , but if 2 was taken away, you couldn't take 1, 3, 4, because 1 and 3 aren't continuous)
The player who takes the last coin wins the game.
Suppose that those two players always take the best moves and never make mistakes.
Your job is to find out who will definitely win the game.
Each case contains two integers N(3<=N<=10 9,1<=K<=10).
23 13 2
Case 1: firstCase 2: second
#include<iostream>#include<cstdio>#include<cstring>using namespace std;int main(){ int count=0; int t; scanf("%d",&t); while(t--) { count++; int n,k; scanf("%d%d",&n,&k); printf("Case %d: ",count); if(k>=n) { printf("first\n"); continue; } else if(k==1) { if(n%2==0) printf("second\n"); else printf("first\n"); } else printf("second\n"); } return 0;}
0 0
- HDU 3951 Coin Game
- HDU:3951 Coin Game
- Hdu 3951 Coin Game
- 【hdu 3951】Coin Game
- HDU 3951 Coin Game
- hdu 3951 Coin Game
- hdu 3951 博弈 Coin Game
- HDU 3951 Coin Game 博弈论
- hdu 3951 - Coin Game(找规律)
- JAVA hdu 3951 Coin Game(博弈)
- HDU 3951 Coin Game 简单博弈
- HDU 3951 Coin Game (博弈)
- HDU 3951 Coin Game(博弈)
- HDU 3951 Coin Game (博弈论、对称性)
- HDU 3951 Coin Game (博弈)
- hdu 3951 Coin Game(对称博弈)
- Hdu 3951 Coin Game【对称博弈】
- HDU 3951 Coin Game(博弈)
- Android开发之RecyclerView的基本使用(实现常用的4种效果)
- Fragment坑之Can not perform this action after onSaveInstanceState
- java虚拟机(一知半解)
- 数据结构——树形结构概念
- for循环的三种方式
- HDU 3951 Coin Game
- Apache-NiFi授权与用户认证
- dokuwiki常用操作
- 蓝桥杯之二阶魔方旋转(第二种方法)
- java后台逻辑和SQL查询逻辑的思考
- NUC郭姐的数学
- spring 自动注入bean,不用一个一个去配置<bean/>的方法
- 杭电1829 A Bug's Life 并查集
- L