[3951]:Coin Game
2016-04-22 14:07
211 查看
Problem Description
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<=109,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
2
3 1
3 2
Sample Output
Case 1: first
Case 2: second
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<=109,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
2
3 1
3 2
Sample Output
Case 1: first
Case 2: second
#include<stdio.h> int main(){ int t; scanf("%d",&t); int n, k, cases = 0; while(t--){ scanf("%d%d",&n, &k); printf("Case %d: ",++cases); if(k>=n){ printf("first\n"); continue; } if(k==1){ if(n&1){ printf("first\n"); } else{ printf("second\n"); } }else { //当k>=2时,后手一定可以使下一个局面为对称的, 因此一定会赢 printf("second\n"); } } return 0; }
相关文章推荐
- 跨进程通信之WM_COPYDATA
- 如何设计一款好的app
- SQL执行计划
- SQL执行计划
- etcd部署集群的三种方式
- 乞丐月入47万,弯腰就能捡钱……在迪拜打拼的中国人告诉你真相
- PAT (Basic Level) Practise (中文)1032. 挖掘机技术哪家强(20)
- overflow:hidden display:inline-block 行内对齐问题
- CSS布局基础之二认识Viewport
- C#实现通过程序自动抓取远程Web网页信息的代码
- WebKit中的Chrome 和 ChromeClient
- 淘淘商城的实践(4)——redis的使用
- mysqlslap压力测试
- 使用diff和patch制作及打补丁
- 人机大战一直有,玩游戏就是最近体验
- css垂直居中的几种方法
- fastcgi_params 与 fastcgi.conf的区别
- 基于gevent和pymysql实现mysql读写的异步非堵塞方案
- OpenCV之gpu 模块. 使用GPU加速的计算机视觉:GPU上的相似度检测(PNSR 和 SSIM)
- select case语句 is和to用法