带着freopen就交也是可以了
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int MAXN=10+5;
const double EPS=1e-6;
double f[MAXN][MAXN],val[MAXN];
int n;
void gauss()
{
for (int i=1;i<=n+1;i++)
{
int t;
for (int j=i;j<=n+1;j++)
{
if (abs(f[j][i])>EPS)
{
t=j;
break;
}
}
if(t!=i)
for(int j=i;j<=n+2;j++)
swap(f[i][j],f[t][j]);
for(int j=i+1;j<=n+1;j++)
{
double tmp=f[j][i]/f[i][i];
for(int k=i;k<=n+2;k++)
f[j][k]-=f[i][k]*tmp;
}
}
for(int i=n+1;i>=1;i--)
{
val[i]=f[i][n+2]/f[i][i];
for(int j=i-1;j>=1;j--)
f[j][n+2]-=val[i]*f[j][i];
}
}
int main()
{
// freopen("a.in","r",stdin);
cin >>n;
for(int i=1;i<=n+1;i++)
{
double sum=0;
for(int j=1;j<=n;j++)
{
scanf("%lf",&f[i][j]);
sum+=f[i][j]*f[i][j];
f[i][j]*=2;
}
f[i][n+1]=1;
f[i][n+2]=sum;
}
gauss();
for(int i=1;i<n;i++)
printf("%.3lf ",val[i]);
printf("%.3lf",val[n]);
return 0;
}