forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathA.cpp
More file actions
40 lines (31 loc) · 1.02 KB
/
A.cpp
File metadata and controls
40 lines (31 loc) · 1.02 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
#include <bits/stdc++.h>
#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 EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define DEBUG(x) { cout << #x << " = "; cout << (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
using namespace std;
int n;
double R, r;
bool can() {
if (n == 1) return R >= r;
else if (n == 2) return R >= 2*r;
else {
if (r > R) return false;
double a = R - r;
double b = r + r;
double alpha = acos((a*a + a*a - b*b) / 2.0 / a / a);
alpha *= n;
return (alpha < 2*acos(-1.0) + 1e-9);
}
}
int main() {
ios :: sync_with_stdio(false);
while (cin >> n >> R >> r) {
cout << (can() ? "YES" : "NO") << endl;
}
}