CodeForces 140A New Year Table 几何

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

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 nR 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:

                                                                                       

 

 

 

这题一开始没注意精度WA了好久....

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <vector>
#include <iomanip>
#include <math.h>
#include <map>
using namespace std;
#define FIN     freopen("input.txt","r",stdin);
#define FOUT    freopen("output.txt","w",stdout);
#define INF     0x3f3f3f3f
#define lson    l,m,rt<<1
#define rson    m+1,r,rt<<1|1
const double PI = acos(-1);
typedef long long LL;

int main()
{
    //FIN
    int n,R,r;
    while(~scanf("%d%d%d",&n,&R,&r))
    {
        if(n==1){
            if(R>=r)  printf("YES\n");
            else  printf("NO\n");
            continue;
        }
        if(n==2){
            if(R>=2*r)  printf("YES\n");
            else  printf("NO\n");
            continue;
        }

        double v=(double)360.0/n;
        double a=R-r;
        double third=(double)sqrt(a*a+a*a-2*a*a*cos(v/180*PI));//求两个碟子圆心的距离
        if(third-2*r>-1e-8&&a>-1e-8)  printf("YES\n");         //控制一下精度
        else  printf("NO\n");

    }
}

  

 

转载于:https://www.cnblogs.com/Hyouka/p/5734673.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值