URAL 1572. Yekaterinozavodsk Great Well（数学啊）

时间：2015-02-07 20:23:43 阅读：143 评论：0 收藏：0 [点我收藏+]

题目链接：http://acm.timus.ru/problem.aspx?space=1&num=1572

About a month ago two teams of the Ural State University returned from the Yekaterinozavodsk training camp. This northern city impressed them so much that they decided to return there by any means. A well-known city legend says that the more covers of sewerage manholes you throw into the famous Great Well, the earlier you return to Yekaterinozavodsk. The programmers have already collected a lot of manhole covers from city streets and now they want to know how many of them can be thrown into the Well.

It is known that the Well‘s aperture and all manhole covers in Yekaterinozavodsk are circles, squares, or equilateral triangles. The covers can be regarded as absolutely flat, and you may rotate and move them in space in any way.

Input

Let us denote a circle by 1, a square by 2, and a triangle by 3. This number will be the type of the figure. The size of a circle is its radius, the size of a square or triangle is the length of its side (the sides have equal lengths). The first line contains two numbers: the type and the size of the Great Well‘s aperture. The second line contains an integer N, which is the number of manhole covers collected by the programmers, 1 ≤ N ≤ 100. These covers are described in the next N lines: each of them contains the type and the size of a cover; the numbers are separated with a space. Sizes of all figures are integers in the range from 1 to 100.

Output

Output the number of covers that are small enough to be thrown into the Well.

Samples

input	output
2 10 3 3 20 1 5 2 11	2
1 5 2 2 10 1 6	1

代码如下：

#include <cstdio>
#include <cstring>
#include <cmath>
int main()
{
    double aa, bb;
    int n;
    double a[147], b[147];
    while(~scanf("%lf%lf",&aa,&bb))
    {
        scanf("%d",&n);
        int k = 0;
        for(int i = 0; i < n; i++)
        {
            scanf("%lf%lf",&a[i],&b[i]);
        }
        double tt;
        if(aa == 1)//圆
        {
            tt = bb*2;
        }
        else if(aa == 2)//正方形
        {
            tt = sqrt(2.0)*bb;
        }
        else if(aa == 3)
        {
            tt = bb;
        }
        double t1;
        for(int i = 0; i < n; i++)
        {
            if(a[i] == 1)//圆
            {
                t1 = b[i]*2;
            }
            else if(a[i] == 2)
            {
                t1 = b[i];
            }
            else if(a[i] == 3)
            {
                t1 = sqrt(3.0)*0.5*b[i];
            }
            if(tt >= t1)
            {
                k++;
            }
        }
        printf("%d\n",k);
    }
    return 0;
}

URAL 1572. Yekaterinozavodsk Great Well（数学啊）

标签：数学 ural

原文地址：http://blog.csdn.net/u012860063/article/details/43607061

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年07月29日 (22)
2021年07月28日 (40)
2021年07月27日 (32)
2021年07月26日 (79)
2021年07月23日 (29)
2021年07月22日 (30)
2021年07月21日 (42)
2021年07月20日 (16)
2021年07月19日 (90)
2021年07月16日 (35)

周排行