2016 ICPC大连赛区 hdu5974 Convex
2016-11-18 19:58
471 查看
Convex
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 170 Accepted Submission(s): 145
Problem Description
We have a special convex that all points have the same distance to origin point.
As you know we can get N segments after linking the origin point and the points on the convex. We can also get N angles between each pair of the neighbor segments.
Now give you the data about the angle, please calculate the area of the convex
Input
There are multiple test cases.
The first line contains two integer N and D indicating the number of the points and their distance to origin. (3 <= N <= 10, 1 <= D <= 10)
The next lines contain N integers indicating the angles. The sum of the N numbers is always 360.
Output
For each test case output one float numbers indicating the area of the convex. The printed values should have 3 digits after the decimal point.
Sample Input
4 1
90 90 90 90
6 1
60 60 60 60 60 60
Sample Output
2.000
2.598
Source
2016ACM/ICPC亚洲区大连站-重现赛(感谢大连海事大学)
Recommend
wange2014 | We have carefully selected several similar problems for you: 5981 5977 5976 5975 5973
讲道理,大连的题目质量怎么这么低,水题也太多了吧。
题意:已知一个凸包,每个点距离原点的距离为定值d,然后给你两两边的夹角,求凸包面积。
思路:将凸包拆成n个三角形,然后套公式就得了。下面给代码:
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<cmath>
typedef long long LL;
using namespace std;
#define maxn 1005
#define ll l,mid,now<<1
#define rr mid+1,r,now<<1|1
#define lson l1,mid,l2,r2,now<<1
#define rson mid+1,r1,l2,r2,now<<1|1
#define pi 3.14159
int main(){
int n,d;
while(~scanf("%d%d",&n,&d)){
double sum=0;
while(n--){
int num;
scanf("%d",&num);
sum+=sin(num*pi/180);
}
printf("%.3lf\n",d*d*sum/2);
}
}
相关文章推荐
- 2016 ICPC大连赛区 hdu5974 A Simple Math Problem
- 2016 ICPC大连赛区 hdu5971 Wrestling Match
- 第一次参加acm-icpc现场赛(2016大连赛区)总结
- 2016 ICPC大连赛区 hdu5980 Find Small A
- 2016 ICPC大连赛区 hdu5978 To begin or not to begin
- HDU 5875 Function -2016 ICPC 大连赛区网络赛
- 2016 ICPC大连赛区 hdu5976 Detachment
- 2016ICPC-大连 Convex (几何)
- hdu 5869 Different GCD Subarray Query 2016ACM/ICPC大连赛区网络赛1002
- hdu 5869 Different GCD Subarray Query 2016ACM/ICPC大连赛区网络赛1006
- HDU 5979 && 2016ICPC大连 I: Convex
- hdu 5875 Function 2016ACM/ICPC大连赛区网络赛1008
- 2016-ICPC-大连赛区总结
- HDU 5974 && 2016ICPC大连 D: A Simple Math Problem
- HDU 5979 Convex【计算几何】 (2016ACM/ICPC亚洲区大连站)
- 【2016-大连赛区网络赛-I】补图最短路(Sparse Graph,hdu 5876)
- hdu 5884 Sort 2016ACM/ICPC青岛赛区网络赛1007
- HDU 5971 && 2016ICPC大连 A: Wrestling Match(二分图判断)
- 【2016-大连赛区网络赛-F】水题(Football Games,hdu 5873)
- hdu 5889 Barricade 2016ACM/ICPC青岛赛区网络赛1011