2016 ICPC大连赛区 [Cloned] I - Convex

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

 

 n边形的面积可以拆分成n个三角形面积之和

而已知每个三角形的两边及两边夹角，我们可以通过三角形面积公式算出每个三角形的面积，相加之和便是最终的n边形面积

无需考虑角度x大于180度情况 此情况下 按s=0.5*a*b*sinx计算 sinx为负值 减去该面积即可

 

 #pragma comment(linker, "/STACK:1024000000,1024000000")
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<queue>
#include<stack>
#include<math.h>
#include<vector>
#include<map>
#include<set>
#include<list>
#include<bitset>
#include<cmath>
#include<complex>
#include<string>
#include<algorithm>
#include<iostream>
#define eps 1e-9
#define LL long long
#define PI acos(-1.0)
#define bitnum(a) __builtin_popcount(a)
using namespace std;
const int N = 5005;
const int M = 100005;
const int inf = 1000000007;
const int mod = 1000000007;
const int MAXN = 100005;
int main()
{
    int n,d,i,x;
    double ans;
    while(~scanf("%d%d",&n,&d))
    {
        ans=0;
        for(i=0;i<n;i++)
        {
            scanf("%d",&x);
            ans+=d*d*sin(PI*x/180)/2;
        }
        printf("%.3f\n",ans);
    }
    return 0;
}