杭电OJ 1115（C++）

#include <iostream>
#include <iomanip>
using namespace std;

struct Point
{
	double x;
	double y;
};

//求三角形面积
double triangleArea(Point p1, Point p2, Point p3)
{
	double area = ((p2.x - p1.x) * (p3.y - p1.y) - (p3.x - p1.x) * (p2.y - p1.y)) / 2.0;
	return area;
}

int main()
{
	int T;
	cin >> T;
	int N;
	double fx, fy; //final x,final y
	double tmpArea, sumArea; //每个三角形面积，多边形总面积
	Point p1, p2, p3;

	while (T--)
	{
		fx = fy = tmpArea = sumArea = 0;
		cin >> N;
		cin >> p1.x >> p1.y >> p2.x >> p2.y;
		for (int i = 2; i < N; i++)
		{
			cin >> p3.x >> p3.y;
			tmpArea = triangleArea(p1, p2, p3);
			fx += (p1.x + p2.x + p3.x) * tmpArea; //当前三角形重心的x坐标
			fy += (p1.y + p2.y + p3.y) * tmpArea; //当前三角形重心的y坐标
			sumArea += tmpArea;
			p2 = p3; //遍历所有三角形
		}
		fx = fx / 3.0 / sumArea;
		fy = fy / 3.0 / sumArea;

		cout << fixed << setprecision(2) << fx << " " << fy << endl;
	}
	return 0;
}