forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathH.cpp
More file actions
79 lines (67 loc) · 1.89 KB
/
H.cpp
File metadata and controls
79 lines (67 loc) · 1.89 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
#include <bits/stdc++.h>
#define int long long
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORD(i, a, b) for (int i = (a), _b = (b); i >= _b; --i)
#define REP(i, a) for (int i = 0, _a = (a); i < _a; ++i)
#define DEBUG(X) \
{ cout << #X << " = " << (X) << endl; }
#define PR(A, n) \
{ \
cout << #A << " = "; \
FOR(_, 1, n) cout << A[_] << ' '; \
cout << endl; \
}
#define PR0(A, n) \
{ \
cout << #A << " = "; \
REP(_, n) cout << A[_] << ' '; \
cout << endl; \
}
#define sqr(x) ((x) * (x))
#define ll long long
#define __builtin_popcount __builtin_popcountll
#define SZ(x) ((int)(x).size())
using namespace std;
double safe_sqrt(double x) { return sqrt(max((double)0.0, x)); }
int GI(ll& x) { return scanf("%lld", &x); }
struct Point {
int x, y;
Point() {}
Point(int x, int y) : x(x), y(y) {}
Point operator-(const Point& a) const { return Point(x - a.x, y - a.y); }
int operator%(const Point& a) const {
return x * a.y - y * a.x;
} // cross product
void read() { cin >> x >> y; }
} a[111];
int ccw(Point a, Point b, Point c) {
int t = (b - a) % (c - a);
assert(t);
if (t < 0) return -1;
return 1;
}
int RE_TRAI = ccw(Point(0, 0), Point(0, 1), Point(-1, 1));
int RE_PHAI = ccw(Point(0, 0), Point(0, 1), Point(1, 1));
#undef int
int main() {
#define int long long
ios::sync_with_stdio(0);
cin.tie(0);
cout << (fixed) << setprecision(9);
int ntest;
cin >> ntest;
while (ntest--) {
int n;
cin >> n;
FOR(i, 1, n) a[i].read();
a[0] = a[n];
a[n + 1] = a[1];
a[n + 2] = a[2];
int sum = 0;
FOR(i, 1, n) {
int j = i + 1;
sum += a[i].x * a[j].y - a[j].x * a[i].y;
}
cout << ((sum > 0) ? "fight" : "run") << '\n';
}
}