hdu 3951 硬币围成一圈（博弈）

n个硬币围成一个环 每次只能取1-K个硬币 最后取完者胜

假如5个硬币 每次取1-2个
情况1 先手取1个 后手取剩下4个中间2个 破坏了连续 虽然最后剩2个，但先手只能取一个 然后后再取一个 后手胜

情况2 先手取2个 后手取剩下3个中间的那1个 然后同理 后手胜

Sample Input
2
3 1//n k
3 2

Sample Output
Case 1: first
Case 2: second

 # include <iostream>
 # include <cstdio>
 # include <cstring>
 # include <algorithm>
 # include <string>
 # include <cmath>
 # include <queue>
 # include <list>
 # define LL long long
 using namespace std ;

 int main()
 {
     int T ;
     scanf("%d" , &T) ;
     int Case =  ;
     while(T--)
     {
         int n , k ;
         Case++ ;
         scanf("%d %d" , &n , &k) ;
         printf("Case %d: " , Case) ;
         if (k ==  && n% == )
             printf("first\n") ;
         else if (k >= n)
             printf("first\n") ;
         else
             printf("second\n") ;
     }
 }