【高斯消元模板】【bzoj 1013】: [JSOI2008]球形空间产生器sphere

http://www.lydsy.com/JudgeOnline/problem.php?id=1013

再换一个模板= =||

//#define _TEST _TEST
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
/************************************************
Code By willinglive    Blog:http://willinglive.cf
************************************************/
#define rep(i,l,r) for(int i=l,___t=(r);i<=___t;i++)
#define per(i,r,l) for(int i=r,___t=(l);i>=___t;i--)
#define MS(arr,x) memset(arr,x,sizeof(arr))
#define LL long long
#define INE(i,u,e) for(int i=head[u];~i;i=e[i].next)
inline const int read()
{int r=0,k=1;char c=getchar();for(;c<'0'||c>'9';c=getchar())if(c=='-')k=-1;
for(;c>='0'&&c<='9';c=getchar())r=r*10+c-'0';return k*r;}
/
int n;
double x[15][15];
double a[15][15];
/
const double eps=1e-6;
double sqr(double x){return x*x;}
void gauss()
{
	int i,j;
	for(i=1;i<=n&&j<=n;j++)
	{
		int pos=i+1;
		rep(j,i+1,n) if(abs(a[pos][i])) {pos=j;break;}
		if(a[pos][i])
		{
			if(i^pos) rep(j,i,n+1) swap(a[i][j],a[pos][j]);
			rep(j,i+1,n)
			{
				double t=a[j][i]/a[i][i];
				rep(k,i,n+1) a[j][k]-=t*a[i][k];
			}
			i++;
		}
	}
	per(i,n,1)
	{
		rep(j,i+1,n) a[i][n+1]-=a[j][n+1]*a[i][j];
		a[i][n+1]/=a[i][i];
	}
}
/
void input()
{
    n=read();
    rep(i,1,n+1) rep(j,1,n) scanf("%lf",&x[i][j]);
    rep(i,1,n)
    {
    	rep(j,1,n) a[i][n+1]+=sqr(x[i][j])-sqr(x[i+1][j]);
    	rep(j,1,n) a[i][j]=2*(x[i][j]-x[i+1][j]);
    }
}
void solve()
{
    gauss();
    rep(i,1,n-1) printf("%.3lf ",a[i][n+1]);
    printf("%.3lf",a[n][n+1]);
}
/
int main()
{
    freopen("std.in","r",stdin); freopen("std.out","w",stdout);
    input(),solve();
    return 0;
}