UVA 11186 - Circum Triangle

题目链接

 

思路来源

#include <cstdio>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <string>
#include <map>
#include <vector>
#include <set>
#include <queue>
#include <stack>
using namespace std;

int main()
{
	int n;
	double r;
	while(scanf("%d%lf",&n,&r)!=EOF&&n&&r){
		double a[500];
		for(int i=0;i<n;i++){
			scanf("%lf",&a[i]);
			a[i]=a[i]/180*acos(-1);
		}
		sort(a,a+n);
		double num=0;
		for(int i=0;i<n-1;i++)
			for(int j=i+1;j<n;j++)
				num+=(n+2*i-2*j)*sin(a[j]-a[i]);
		num=0.5*r*r*num;
		num=floor(num+0.5);
		printf("%lld\n",(long long)num);
	}
}