Educational Codeforces Round 77 (Rated for Div. 2) C. Infinite Fence（扩展欧几里得）

题目链接

#include<bits/stdc++.h>
using namespace std;
int gcd(int a,int b)
{
	return b==0 ?a:gcd(b,a%b);
 } 
 int main()
 {
 	int T,r,b,k;
 	scanf("%d",&T);
 	while(T--){
 		scanf("%d%d%d",&r,&b,&k);
 		int g=gcd(r,b);
 		if(r>b) swap(r,b);
 		printf("%s\n",((b-1-g)/r+1>=k?"REBEL":"OBEY"));
	 }
 }