前往小程序,Get更优阅读体验!
立即前往
首页
学习
活动
专区
工具
TVP
发布
社区首页 >专栏 >CodeForces 157B Trace

CodeForces 157B Trace

作者头像
ShenduCC
发布2018-04-26 17:25:09
1.1K0
发布2018-04-26 17:25:09
举报
文章被收录于专栏:算法修养

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

代码语言:javascript
复制
1
1

output

代码语言:javascript
复制
3.1415926536

input

代码语言:javascript
复制
3
1 4 2

output

40.8407044967

代码语言:javascript
复制
#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\n",sum);
    return 0;
}
本文参与 腾讯云自媒体同步曝光计划,分享自作者个人站点/博客。
原始发表:2016-05-07 ,如有侵权请联系 cloudcommunity@tencent.com 删除

本文分享自 作者个人站点/博客 前往查看

如有侵权,请联系 cloudcommunity@tencent.com 删除。

本文参与 腾讯云自媒体同步曝光计划  ,欢迎热爱写作的你一起参与!

评论
登录后参与评论
0 条评论
热度
最新
推荐阅读
领券
问题归档专栏文章快讯文章归档关键词归档开发者手册归档开发者手册 Section 归档