zoukankan      html  css  js  c++  java
  • CodeForces 157B Trace

    B. Trace
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    One day, as Sherlock Holmes was tracking down one very important criminal, he found a wonderful painting on the wall. This wall could be represented as a plane. The painting had several concentric circles that divided the wall into several parts. Some parts were painted red and all the other were painted blue. Besides, any two neighboring parts were painted different colors, that is, the red and the blue color were alternating, i. e. followed one after the other. The outer area of the wall (the area that lied outside all circles) was painted blue. Help Sherlock Holmes determine the total area of red parts of the wall.

    Let us remind you that two circles are called concentric if their centers coincide. Several circles are called concentric if any two of them are concentric.

    Input

    The first line contains the single integer n (1 ≤ n ≤ 100). The second line contains n space-separated integers ri (1 ≤ ri ≤ 1000) — the circles' radii. It is guaranteed that all circles are different.

    Output

    Print the single real number — total area of the part of the wall that is painted red. The answer is accepted if absolute or relative error doesn't exceed 10 - 4.

    Examples
    input
    1
    1
    
    output
    3.1415926536
    
    input
    3
    1 4 2
    
    output

    40.8407044967

    #include <iostream>
    #include <string.h>
    #include <stdlib.h>
    #include <algorithm>
    #include <math.h>
    #include <stdio.h>
    
    using namespace std;
    double pi=2*asin(1.0);
    int n;
    double a[105];
    int main()
    {
        scanf("%d",&n);
        for(int i=1;i<=n;i++)
            scanf("%lf",&a[i]);
            sort(a+1,a+n+1);
        double sum;
        if(n&1)
        {
            sum=pi*a[1]*a[1];
            for(int i=2;i<=n;i+=2)
            {
                sum+=pi*(a[i+1]*a[i+1]-a[i]*a[i]);
            }
        }
        else
        {
            sum=0;
            for(int i=2;i<=n;i+=2)
            {
                sum+=pi*(a[i]*a[i]-a[i-1]*a[i-1]);
            }
        }
        printf("%lf
    ",sum);
        return 0;
    }
    


  • 相关阅读:
    sql server 修改/查看 主键初始值
    国内外邮箱正则验证及js示例
    修改表中主键 标识/初始值
    主角场景Shader效果:遮挡透明
    主角场景效果:人物阴影
    主角场景Shader效果:描边
    主角场景Shader效果:光影
    Unity ZTest深度测试 & ZWrite深度写入
    天气系统:雨、雪
    UnityShader 序列帧动画效果
  • 原文地址:https://www.cnblogs.com/dacc123/p/8228644.html
Copyright © 2011-2022 走看看