Sicily 1206 Stacking Cylinders

由下面两个圆圆心的坐标求上面那个圆的坐标，如图，由(x1, y1)(x2, y2)求(x3, y3)

别被输入示例骗了，有乱序的情况。

#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
	int cases;
	cin>>cases;
	int counter=0;
	while (++counter<=cases) {
		int n;
		cin>>n;
		vector<pair<double, double> > cs(n*(n+1)/2);
		for (int i=0; i<n; i++)
			cin>>cs[i].first;
		for (int i=0; i<n; i++)
			cs[i].second=1;
		sort(cs.begin(), cs.begin()+n);
		int i=n;
		while(n>1) {
			for (int j=0; j<n-1; j++) {
				double t1=cs[i-(n-1)].first-cs[i-n].first;
				double t2=cs[i-(n-1)].second-cs[i-n].second;
				double a1=atan(t2/t1);
				double a2=acos(sqrt(t1*t1+t2*t2)/2/2);
				double a=a1+a2;
				cs[i].first=cs[i-n].first+2*cos(a);
				cs[i].second=cs[i-n].second+2*sin(a);
				++i;
			}
			--n;
		}
		cout.precision(4);
		cout<<counter<<": "<<fixed<<cs[cs.size()-1].first<<" "
			<<fixed<<cs[cs.size()-1].second<<"\n";
	}

	return 0;
}

// by wbchou
// Feb 20, 2013