hdu3951 Coin Game
来源:互联网 发布:java存储数据的方法 编辑:程序博客网 时间:2024/06/06 08:03
Coin Game
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 972 Accepted Submission(s): 592
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.
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).
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
23 13 2
Sample Output
Case 1: firstCase 2: second
Author
NotOnlySuccess
如果,第一个人,没有把一个环都取走,那么就化环成线了,第二个人,可以了中间的,就形成了对称的两段就可以保证能胜了,但是有一个情况每二个人,不能取到中间的,就是形成了线之后的如果是偶数个,但是k为1,所以这种情况单独分类就可以了,这种情况也简单 只要比是奇还是偶就可 以了!
#include <iostream>#include <stdio.h>#include <string.h>using namespace std;int main(){ int n,k,tcase,tt=1; scanf("%d",&tcase); while(tcase--){ scanf("%d%d",&n,&k); printf("Case %d: ",tt++); if(n<=k)printf("first\n"); else { if(k>=2) printf("second\n"); else { if((n-1)&1) printf("second\n"); else printf("first\n"); } } } return 0;}
- hdu3951 Coin Game
- hdu3951 Coin Game
- hdu3951 Coin Game---博弈 对称性
- nim博弈 hdu3951 Coin Game
- hdu3951 Coin Game(简单博弈)
- ACM-对称博弈之Coin Game——hdu3951
- hdu3951——Coin Game(简单博弈)
- Coin Game
- HDU3951
- hdu3951
- NYOJ 401 Coin Game
- A Coin Game
- HDU 3951 Coin Game
- HDU:3951 Coin Game
- Hdu 3951 Coin Game
- HDOJ 3951 Coin Game
- [3951]:Coin Game
- 【hdu 3951】Coin Game
- 查询SqlServer下查询所有指定用户下的主外键,索引
- 检查mysql是否存在坏表
- Essential iOS 7 Developer’s Guide
- C语言的静态函数
- Introduction to UIKit Dynamics
- hdu3951 Coin Game
- 数据库取前几条记录的语句
- 关于在WP7应用里加入Speech To Text (语音识别) 记录
- UIKit Dynamics Tutorial
- 面向对象编程的六大原则
- linux 改变环境变量无法开机
- 学琴的方法
- linux sudo使用和sudoers配置详解
- Ubuntu 12.04 终端中安装 jdk1.7 (tar.gz)