题意:
两个人博弈,一个n个珠子的环,每人每步要画掉m个连续的珠子,求胜者。
思路:
第一步不管怎么画,得到的下一个状态都是一样的,一条(n-m)个珠子的链,所以第一步先特判n<m的情况,然后套用sg函数得到当前状态(n-m)个珠子在一条链的sg值,为0时后手赢,因为第一步要将n个变成(n-m)个,所以要交换先后手。
代码:
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <cstring>
#include <cctype>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <map>
#include <list>
#include <set>
#include <stack>
#include <queue>
#include <string>
#include <sstream>
#define pb push_back
#define X first
#define Y second
#define ALL(x) x.begin(),x.end()
#define INS(x) inserter(x,x.begin())
#define pii pair<int,int>
#define qclear(a) while(!a.empty())a.pop();
#define lowbit(x) (x&-x)
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define mst(a,b) memset(a,b,sizeof(a))
#define cout3(x,y,z) cout<<x<<" "<<y<<" "<<z<<endl
#define cout2(x,y) cout<<x<<" "<<y<<endl
#define cout1(x) cout<<x<<endl
#define IOS std::ios::sync_with_stdio(false)
#define SRAND srand((unsigned int)(time(0)))
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
using namespace std;
const double PI=acos(-1.0);
const int INF=0x3f3f3f3f;
const ll INFF=0x3f3f3f3f3f3f3f3f;
const ll mod=998244353;
const double eps=1e-5;
const int maxn=1005;
const int maxm=20005;
int sg[maxn];
int getsg(int n,int m){
if(n<m)return sg[n]=0;
if(sg[n]!=-1)return sg[n];
bool vis[maxn];
mst(vis,0);
int deta=n-m;
for(int i=0;i<=deta;i++){
vis[getsg(i,m)^getsg(deta-i,m)]=1;
}
for(int i=0;;i++){
if(!vis[i]){
sg[n]=i;
break;
}
}
return sg[n];
}
void solve() {
int t;
sd(t);
int kase=1;
while(t--){
int n,m;
sdd(n,m);
mst(sg,-1);
bool ok;
if(n<m){
ok=0;
}else{
if(getsg(n-m,m))ok=0;
else ok=1;
}
printf("Case #%d: ",kase++);
if(ok) {
printf("aekdycoin\n");
} else {
printf("abcdxyzk\n");
}
}
return ;
}
int main() {
#ifdef LOCAL
freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
#else
// freopen("","r",stdin);
// freopen("","w",stdout);
#endif
solve();
return 0;
}