典型的巴什博弈题!!!
博弈详情参考:ACM 数论篇——博弈论
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Scanner;
/**
* 题意:中文题,不解析!!!
*
* 分析:典型的巴什博弈。
*
* 解决:一共分为以下两种情况:
* i、当 sumMoney = (oneMaxMoney+1) * k (k 为任意整数)时,后手胜;
* ii、当 sumMoney = (oneMaxMoney+1) * k + s (k 为任意整数,s <= oneMaxMoney)时,先手胜。
*
* @author TinyDolphin
*/
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
int caseNum;
int oneMaxMoney; // 每次捐款最多不超过 oneMaxMoney 元
int sumMoney; // 最先使得总捐款额达到或超过 sumMoney 元的一方获胜
while (in.hasNext()) {
caseNum = in.nextInt();
while (caseNum-- != 0) {
sumMoney = in.nextInt();
oneMaxMoney = in.nextInt();
out.println(sumMoney % (oneMaxMoney + 1) == 0 ? "Rabbit" : "Grass");
}
}
out.flush();
}
}