题目大意:
中文题目不说大意了...
大致思路:
最最基本的巴什博弈的模型了, n % (m + 1) == 0时先手败, 否则先手胜
代码如下:
Result : Accepted Memory : 1576 KB Time : 0 ms
/*
* Author: Gatevin
* Created Time: 2015/5/6 19:58:56
* File Name: Rin_Tohsaka.cpp
*/
#include<iostream>
#include<sstream>
#include<fstream>
#include<vector>
#include<list>
#include<deque>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cctype>
#include<cmath>
#include<ctime>
#include<iomanip>
using namespace std;
const double eps(1e-8);
typedef long long lint;
#define foreach(e, x) for(__typeof(x.begin()) e = x.begin(); e != x.end(); ++e)
#define SHOW_MEMORY(x) cout<<sizeof(x)/(1024*1024.)<<"MB"<<endl
int main()
{
int T;
int n, m;
scanf("%d", &T);
while(T--)
{
scanf("%d %d", &n, &m);
if( n % (m + 1)) puts("Grass");
else puts("Rabbit");
}
return 0;
}