【环形博弈】hdu3951

题目:

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

思路：

如果k=1,只能一个个取，直接判断即可。
如果k!=1,当k>=n时，可一次性取到先取必胜，
反之，后手每一次都让情况平分，取和先手相同数量，并且让相同硬币数量的堆是可以先后手平分的，那么后手必胜。

#include<iostream>
#include<algorithm>
#include<cmath>
#include<string>
#include<string.h>
#include<cstring>
#include<cstdio>
using namespace std;
int t;

int main()
{
    cin>>t;
    int num=0;
    while(t--)
    {
        num++;
        int n=0,k=0;
        cin>>n>>k;
         cout<<"Case "<<num<<": ";
        if((k==1&&n%2==1)||k>=n)
        {
            cout<<"first"<<endl;
        }
        else
            cout<<"second"<<endl;
    }
    return 0;
}