Codeforces 140 A. New Year Table（计算几何）

传送门
A. New Year Table
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard 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 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.

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:
题目大意：
给一个大圆的半径 $R$ 和一个小圆的半径 $r$，小圆必须在大圆内且与大圆相切。求满足该要求的小圆最多放多少个,如果 $>n$ 的话 就输出 $NO$，否则输出 $YES$

解题思路：
首先我们求一下，大圆的圆心 到 小圆的切线，然后连接小圆的圆心与其切线形成的切点，然后我们得到一个由 大圆圆心 小圆圆心 和 切点组成的直角三角形，那么 大圆的一个圆心角的一半为 $arcsin(r/(R-r))$，所以最多有 $\frac{2*PI }{2*arcsin(r/(R-r))}$，然后就是比较上式与 $n$ 的大小就行了。
$My$ $Code$：

/**
2016 - 08 - 03 晚上
Author: ITAK

Motto:

今日的我要超越昨日的我，明日的我要胜过今日的我，
以创作出更好的代码为目标，不断地超越自己。
**/

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <set>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
const int INF = 1e9+5;
const int MAXN = 1e3+5;
const int MOD = 1e9+7;
const double eps = 1e-7;
const double PI = acos(-1);
int main()
{
    int n;
    double R, r;
    while(cin>>n>>R>>r)
    {
        if(n == 1)
        {
            if(R >= r)
                puts("YES");
            else
                puts("NO");
            continue;
        }
        double tmp = asin(r/(R-r));///圆心角的一半
        if(PI/tmp-n > -eps)
            puts("YES");
        else
            puts("NO");
    }
    return 0;
}