# HDU3951 创建对称局势【博弈水题】

## Coin Game

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

2
3 1
3 2

Sample Output

Case 1: first
Case 2: second

1. 若先手一次可以取完（N<=K)，先手必胜
2. 若K=1，显然N为奇数，先手必胜
3. 若K>=2，后手只需要创建一个对称局势，即把这条链分成两条相等的链，先手必败
import java.util.*;
import java.math.*;

public class Main{
static int MAXN=(int)(2e5+10);
static long n;

public static void main(String[] args) {
Scanner cin=new Scanner(System.in);
int T=cin.nextInt();
int ca=1;
while((T--)!=0) {
n=cin.nextLong();
int k=cin.nextInt();
System.out.print("Case "+ ca++ +": ");
if(n<=k) {
System.out.println("first");
continue;
}
if(k==1) {
if(n%2==1)
System.out.println("first");
else
System.out.println("second");
continue;
}
System.out.println("second");
}
cin.close();
}
}

# 2018年ACM-ICPC 南京现场赛 A.Adrien and Austin

## 思路

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <stack>
#include <list>
int main()
{
int n,k;
scanf("%d%d",&n,&k);
if(n==0)
{
printf("Austin\n");
}
else if(k==1)
{
if(n%2==1)
else
printf("Austin\n");
}
else
return 0;
}