zoukankan      html  css  js  c++  java
  • 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
    ");
                else  printf("NO
    ");
                continue;
            }
            if(n==2){
                if(R>=2*r)  printf("YES
    ");
                else  printf("NO
    ");
                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
    ");         //控制一下精度
            else  printf("NO
    ");
    
        }
    }
    

      

  • 相关阅读:
    数据库优化之三:数据表设计
    JavaScript:实现弹出框的选择(转载)
    HTML and CSS 之三
    容祖儿 《Jump Up 9492》[MP3!]
    微软的 3层结构教程
    CodeSmith
    Alienwave.CommunityServer 开发笔记 1
    Microsoft .NET Framework 3.0 预发行版本 2006年6月CTP
    三国无双 4 PC 版释出
    KOKIA 《THE POWER OF SMILE》单曲[MP3!]
  • 原文地址:https://www.cnblogs.com/Hyouka/p/5734673.html
Copyright © 2011-2022 走看看