HDU 5979 Convex

Convex

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 172    Accepted Submission(s): 147

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 

cos,sin,asin,acos 这些三角函数操作的是弧度，而非角度

弧度+角度*PI/180   (PI=acos(-1.0））

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#define PI acos(-1.0)
using namespace std;
int main()
{
	int n,i,j,k,l,b,c;
	double d,a;
	while(scanf("%d%lf",&n,&d)!=EOF)
	{
		double sum=0;
		for(i=0;i<n;i++)
		{
			scanf("%lf",&a);
			sum+=0.5*d*d*sin(a*PI/180.0);
		}
		printf("%.3lf\n",sum);
	}
	return 0;
}