#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
using namespace std;
int main()
{
int t;
scanf("%d",&t);
while(t --)
{
int m, n;
scanf("%d%d",&n,&m);
if(n%(m+1)==0) printf("Rabbit\n");
else printf("Grass\n");
}
return 0;
}
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
using namespace std;
int main()
{
int t;
scanf("%d",&t);
while(t --)
{
int m, n;
scanf("%d%d",&n,&m);
if(n%(m+1)==0) printf("second\n");
else printf("first\n");
}
return 0;
}
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
using namespace std;
int main()
{
int m, n;
while(scanf("%d%d",&n,&m) != EOF)
{
if(n%(m+1)==0) printf("none\n");
else if(n%(m+1)&&n/(m+1))
printf("%d\n",n%(m+1));
else
{
for(int i = n; i <= m; i ++)
{
if(i == n) printf("%d",i);
else printf(" %d",i);
}
printf("\n");
}
}
return 0;
}
POJ - 2368(算术基本定理)
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
using namespace std;
int main()
{
int k;
while(scanf("%d",&k) != EOF)
{
bool flag = 1;
int K = k;
for(int i = 2; i * i < k; i ++)
{
if(K % i == 0)
{
K /= i;
if(i > 2)
{
printf("%d\n",i-1);
flag = 0;
break;
}
}
}
if(K != 1 && K > 2 && flag)
{
printf("%d\n",K-1);
flag = 0;
continue;
}
if(flag) printf("0\n");
}
return 0;
}
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
using namespace std;
int main()
{
int t;
scanf("%d",&t);
while(t --)
{
int m, n;
scanf("%d%d",&n,&m);
if(n%(m+1))printf("A\n");
else printf("B\n");
}
return 0;
}
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
using namespace std;
int main()
{
int t;
scanf("%d",&t);
while(t --)
{
int n;
scanf("%d",&n);
if(n%7==2||n%7==0)printf("B\n");
else printf("A\n");
}
return 0;
}
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
using namespace std;
int main()
{
int t;
scanf("%d",&t);
while(t --)
{
char a[1005];
scanf("%s",a);
int n = strlen(a);
int ans = 0;
for(int i = 0; i < n; i ++)
ans += (a[i]-'0');
if(ans % 3) printf("A\n");
else printf("B\n");
}
return 0;
}