CodeForces 140A New Year Table

A - New Year Table

Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  CodeForces 140A

Description

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 n, R and r (1 ≤ n ≤ 100, 1 ≤ 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.

Sample Input

Input

4 10 4

Output

YES

Input

5 10 4

Output

NO

Input

1 10 10

Output

YES

Hint

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

表示应该是好久没做这种思维题了，刚开始没有什么状态呢。刚开始做这题老是就忘那些比较难的板子上套QAQ，之前的一个思路是往正确的道路上走的，然而并没就深下去想，而又是跳到了别的思路上去了QAQ。看样思维题最近做的太少了。

思路：连接大圆圆心和小圆的圆心，然后过大圆圆心做小圆的切线。

表示博主不太会用这画图，通过图形我们可以看出每个小圆所占的圆心角都是可以计算的，那么我们可以知道最多的圆是多少个，和给定的值比较就可以了。

注意：

1.精度问题 要用1e-8；

2.要考虑好图形上的斜边不一定是斜边，也就是说要考虑r与R-r的大小的关系。不是斜边的情况下特殊考虑。

3.如果R<r那么直接输出NO就可以了。

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
double eps=1e-8;
int main()
{
    int n,R,r;
    scanf("%d%d%d",&n,&R,&r);
    if(R<r)puts("NO");
    else
    {
        if(R>=2*r)
        {
            double p=asin(r*1.0/(R-r));
            if(p*n*2-2*acos(-1)>eps)printf("NO\n");
            else printf("YES\n");
        }
        else
        {
            if(n==1)printf("YES\n");
            else printf("NO\n");
        }
    }
    return 0;
}