摘要:
/*转换成Nim模型,对于每个棋子位于的位置b,G[b] = 0,即sg[b] = b多个棋子异或一遍就得出答案了,为0先手必败。*/#include<stdio.h>int main(){ int n, a, b; while(scanf("%d", &n), n) { scanf("%d", &a); n --; while(n --) { scanf("%d", &b); a ^= b; } puts(a ? "Rabbit Win!" : "... 阅读全文
摘要:
/*Nim模型*/#include<stdio.h>#include<string.h>#include<stdlib.h>const int MAXM = 105;int m, ni[MAXM];int main(){ int i, cnt, res; while(scanf("%d", &m), m) { res = cnt = 0; for(i = 1; i <= m; i ++) { scanf("%d", &ni[i]); res ^= ni[i]; } ... 阅读全文
摘要:
/*巴什博弈的模型*/#include<stdio.h>int main(){ int n, m, T; scanf("%d", &T); while(T --) { scanf("%d%d", &n, &m); puts((n % (m + 1)) ? "Grass" : "Rabbit"); } return 0;} 阅读全文
摘要:
/*巴什博弈先判断是不是先手必败*/#include<stdio.h>int main(){ int m, n, i; while(scanf("%d%d", &m, &n) != EOF) { if(m > n) //这种情况先手非必败的话只有一种出法 { if(m % (n + 1) == 0) { puts("none"); continue; } else prin... 阅读全文