CodeForces 157B - Trace
来源:互联网 发布:瓷秀软件下载 编辑:程序博客网 时间:2024/06/10 22:41
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.
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.
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.
11
3.1415926536
31 4 2
40.8407044967
In the first sample the picture is just one circle of radius 1. Inner part of the circle is painted red. The area of the red part equals π × 12 = π.
In the second sample there are three circles of radii 1, 4 and 2. Outside part of the second circle is painted blue. Part between the second and the third circles is painted red. Part between the first and the third is painted blue. And, finally, the inner part of the first circle is painted red. Overall there are two red parts: the ring between the second and the third circles and the inner part of the first circle. Total area of the red parts is equal (π × 42 - π × 22) + π × 12 = π × 12 + π = 13π
================================
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;bool cmp(int a,int b){ return a>b;}int main(){ int n,a[111]; scanf("%d",&n); for(int i=0;i<n;i++) { scanf("%d",&a[i]); } sort(a,a+n,cmp); int flag=1,sum=0; for(int i=0;i<n;i++) { if(flag) { sum+=a[i]*a[i]; flag=!flag; } else { sum-=a[i]*a[i]; flag=!flag; } } double ans=sum*3.141592653589793; printf("%lf\n",ans); return 0;}
- CodeForces 157B - Trace
- CodeForces 157B Trace
- Trace CodeForces
- B. Trace
- codeforces B
- codeforces B
- codeforces B
- codeforces B
- CodeForces 626B CodeForces 626B【暴力】
- CodeForces 841B (B) 博弈
- TRACE
- trace
- TRACE
- TRACE
- trace
- Trace
- TRACE
- Trace
- Windows下获取硬件信息的编程(CPU、硬盘、内存和启动时间等)
- soa与云计算之微刊参考
- sqlite第三方类库:FMDB使用(转载)
- stat函数相关知识
- javascript 无刷新 上传 在java 中调用javascript 代码 的回调函数
- CodeForces 157B - Trace
- Run SilkTest tests in a minimised RDP session
- 分析Query 语句对系统性能的影响
- COM 之 VARIANT_BOOL
- Android关机流程源码分析
- ORACLE的索引和约束详解
- 一个人的命运决定于晚上8点到10点间
- 将“PDF转换成PPT”与“PPT转PDF”的方法
- 2013 ACM/ICPC Asia Regional Chengdu Online