HDU - 3980 Paint Chain

Aekdycoin and abcdxyzk are playing a game. They get a circle chain with some beads. Initially none of the beads is painted. They take turns to paint the chain. In Each turn one player must paint a unpainted beads. Whoever is unable to paint in his turn lose the game. Aekdycoin will take the first move.

Now, they thought this game is too simple, and they want to change some rules. In each turn one player must select a certain number of consecutive unpainted beads to paint. The other rules is The same as the original. Who will win under the rules ?You may assume that both of them are so clever.

Input

First line contains T, the number of test cases. Following T line contain 2 integer N, M, indicate the chain has N beads, and each turn one player must paint M consecutive beads. (1 <= N, M <= 1000)

Output

For each case, print "Case #idx: " first where idx is the case number start from 1, and the name of the winner.

Sample Input

2 
3 1 
4 2

Sample Output

Case #1: aekdycoin 
Case #2: abcdxyzk

 

组合游戏的和： 假设有K个组合游戏，每次任选一个子游戏进行操作，其他的游戏局面不变，不能操作的游戏者输。

SG函数和SG定理：

是 的后继状态 值的集合，   就是不在    内的最小非负整数。

  当且仅当    是必败状态（因为后继状态是空集，所以为0）

#include <bits/stdc++.h>

using namespace std;

#define rep(i,a,b) for(int i=a;i<b;++i)

int n,m;
const int N=1010;
int SG[N];


int dfs(int x,int m){
	//if(x==m)return 1;
    if(SG[x]!=-1)return SG[x];

    //必败态，没有后继状态，所以SG[x]=0;
    if(x<m)return 0;

    //后继状态SG值
    int mex[N];
    memset(mex,0,sizeof(mex));
    int res=0;
    for(int i=1;i+m-1<=x;i++){
        int t1=dfs(i-1,m),t2=dfs(x-(i+m-1),m);
       // printf("x:%d t1:%d t2:%d t1^t2:%d\n",x,t1,t2,t1^t2);
        mex[t1^t2]=1;
    }
    for(int i=0;;i++){
		if(!mex[i]){
			SG[x]=i;break;
		}
    }
   // printf("x:%d SG:%d\n",x,SG[x]);
    return SG[x];
}

int main()
{
    int T;
    scanf("%d",&T);
    rep(kase,1,T+1){
        scanf("%d %d",&n,&m);
        
        memset(SG,-1,sizeof(SG));
       // SG[0]=0;

        printf("Case #%d: ",kase);
        if(m>n){
            printf("abcdxyzk\n");
        }else{
            int ans=dfs(n-m,m);
			//printf("**ans:%d\n",ans);
            if(ans==0)printf("aekdycoin\n");
            else printf("abcdxyzk\n");
        }
    }
    return 0;
}