# Codeforces 140A New Year Table（大圆带小圆）

A. New Year Table
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Gerald is setting the New Year table. The table has the form of a circle; its radius equals R. Gerald invited many guests and is concerned whether the table has enough space for plates for all those guests. Consider all plates to be round and have the same radii that equal r. Each plate must be completely inside the table and must touch the edge of the table. Of course, the plates must not intersect, but they can touch each other. Help Gerald determine whether the table is large enough for n plates.

Input

The first line contains three integers nR and r (1 ≤ n ≤ 1001 ≤ r, R ≤ 1000) — the number of plates, the radius of the table and the plates' radius.

Output

Print "YES" (without the quotes) if it is possible to place n plates on the table by the rules given above. If it is impossible, print "NO".

Remember, that each plate must touch the edge of the table.

Examples
input
4 10 4
output
YES
input
5 10 4
output
NO
input
1 10 10
output
YES
Note

The possible arrangement of the plates for the first sample is:

AC CODE：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;

const double PI = acos(-1.0);

int main()
{
double n, R, r;
cin >> n >> R >> r;

if(n == 1) {
if(R >= r) puts("YES");
else puts("NO");
} else {
if(R < r) puts("NO");
else {
double jiao = 2.0 * asin(r/(R-r));
double Get_n = 2.0*PI / jiao;/* 最多可以放置的小圆个数*/
Get_n += 0.00000000005;/* 务必留意精度问题 */
if(Get_n - n >= 0) puts("YES");
else puts("NO");
}
}

return 0;
}

03-09 58万+

08-03 770

11-06 2711

04-22 1万+

02-23 722

03-18 3万+

09-10 1757

06-10 104

04-16 1万+

#### 数学教材推荐

©️2020 CSDN 皮肤主题: 大白 设计师: CSDN官方博客

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、C币套餐、付费专栏及课程。