博弈咯～

欢迎访问https://blog.csdn.net/lxt_Lucia～～

宇宙第一小仙女\(^o^)/～～萌量爆表求带飞=≡Σ((( つ^o^)つ~dalao们点个关注呗～～

王者最近出了个英雄叫弈星，一听名字就比较炫酷了，emmm那我也博弈一下好啦～虽然比叫菜。。。。Problem is coming～～～～

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<=10 ⁹,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

就是两个人轮流啦....

思路：先看是不是两个人都是每次都只能拿一个(b==1)，是的话那就对2求余，为1则先手赢，为0则后手赢。如果两个人每次拿的不是1个(b!=1)，那就看a和b谁大咯～a>b则后手赢，otherwise先手就赢咯～

-----------------------------------------------------------我只是一条可爱的分界线------------------------------------------------------------------

#include<bits/stdc++.h>
int main()
{
    int i;
    long long int n,a,b;
    scanf("%lld",&n);
    for(i=1;i<=n;i++){
        scanf("%lld%lld",&a,&b);
        if(b!=1){
           if(a<=b)
              printf("Case %d: first\n",i);
           else printf("Case %d: second\n",i);
        }
        else{
           if(a%2!=0)
              printf("Case %d: first\n",i);
           else printf("Case %d: second\n",i);
        }
    }
    return 0;
}

宇宙第一小仙女\(^o^)/～～萌量爆表求带飞=≡Σ((( つ^o^)つ~dalao们点个关注呗～～

有会下棋的没事也可以一起下棋咯～

欢迎访问https://blog.csdn.net/lxt_Lucia～～