27 div2】C. Infinite Fence

 1 #pragma warning(disable:4996)
 2  
 3 #include<iostream>
 4 #include<string>
 5 #include<queue>
 6 #include<stack>
 7 #include<vector>
 8 #include<map>
 9 #include<cstdio>
10 #include<cstdlib>
11 #include<algorithm>
12 #include<set>
13 #include<list>
14 #include<iomanip>
15 #include<cstring>
16 #include<cmath>
17 #include<limits>
18 using namespace std;
19  
20 #define au auto
21 #define debug(i) cout<<"<debug> "<<i<<" <\debug>"<<endl
22 #define mfor(i,a,b) for(register int i=(a);i<=(b);i++)
23 #define mrep(i,a,b) for(register int i=(a);i>=(b);i--)
24 #define LLL __int128
25 #define Re register
26 #define il inline
27 #define mem(a,b) memset(a,(b),sizeof(a))
28 #define Design ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
29 typedef pair<int, int> intpair;
30 typedef pair<long long int, long long int> llpair;
31 typedef long long int LL;
32 const int INF = 0x3f3f3f3f;
33 const long long int INFLL = 0x3f3f3f3f3f3f3f3f;
34  
35 const int maxn = 200010;
36  
37 struct trap
38 {
39     int l, r;
40     int d;
41     trap() {}
42     trap(int a, int b, int c)
43     {
44         l = a, r = b, d = c;
45     }
46     bool operator <(trap s)
47     {
48         return r < s.r;
49     }
50 };
51  
52 bool cmp(trap a, trap b)
53 {
54     return a.d > b.d;
55 }
56  
57 priority_queue<int, vector<int>, greater<int>>a;
58 vector<trap>tr;
59  
60 int gcd(int a, int b)
61 {
62     if (!b) return a;
63     return gcd(b, a % b);
64 }
65  
66 int main()
67 {
68     Design;
69     int T;
70     cin >> T;
71     while (T--)
72     {
73         int r, b, k;
74         cin >> r >> b >> k;
75         if (r > b) swap(r, b);
76         int t = gcd(b, r);
77         r /= t;
78         b /= t;
79         if ((LL)r * (k - 1) + 1 < b)
80         {
81             cout << "REBEL" << endl;
82         }
83         else cout << "OBEY" << endl;
84     }
85 }
View Code
posted on 2019-11-29 18:24 thjkhdf12 阅读(165) 评论(0) 收藏举报