第一次写高斯消元啦啦啦~~
#include <cstdio>
#include <cmath>
#include <algorithm>
#define db double
#define rep(i,j,k) for (i=j;i<=k;i++)
#define down(i,j,k) for (i=j;i>=k;i--)
using namespace std;
const int N=15;
int n,i,j,k;
db tmp,x[N],a[N][N];
void Gauss()
{
int i,j,k,cs;
db z;
rep(i,1,n-1)
{
cs=i;
rep(j,i+1,n)
if (fabs(a[j][i])>fabs(a[cs][i])) cs=j;
rep(j,i,n+1) swap(a[cs][j],a[i][j]);
rep(j,i+1,n) {
z=a[j][i]/a[i][i];
rep(k,i,n+1) a[j][k]-=a[i][k]*z;
}
}
down(i,n,1)
{
x[i]=a[i][n+1]/a[i][i];
rep(j,1,i-1) a[j][n+1]-=x[i]*a[j][i];
}
}
int main()
{
#ifdef ONLINE_JUDGE
#else
freopen("bzoj1013.in","r",stdin);
freopen("bzoj1013.out","w",stdout);
#endif
scanf("%d",&n);
rep(i,1,n+1)
rep(j,1,n)
{
scanf("%lf",&tmp);
a[i][j]-=2*tmp; a[i][n+1]-=tmp*tmp;
}
rep(i,1,n)
rep(j,1,n+1) a[i][j]-=a[i+1][j];
/* rep(i,1,n)
{
rep(j,1,n+1) printf("%.3lf ",a[i][j]);
printf("\n");
}
*/
Gauss();
rep(i,1,n-1) printf("%.3lf ",x[i]);
printf("%.3lf\n",x[n]);
return 0;
}