题意:n(1 <= n <= 10)维球找球心。
分析:
gzz讲的神的高斯消元题...
主要是保存个高斯消元模板吧...
#include <cstdio>
const int N = 15;
int n;
double x[N][N], a[N][N];
int main() {
scanf("%d", &n);
for(int i = 1; i <= n+1; i++)
for(int j = 1; j <= n; j++)
scanf("%lf", &x[i][j]);
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
a[i][j] = x[i+1][j]*2-x[i][j]*2, a[i][n+1] += x[i+1][j]*x[i+1][j]-x[i][j]*x[i][j];
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++) if(i != j) {
double x = a[j][i]/a[i][i];
for(int k = 1; k <= n+1; k++)
a[j][k] -= x*a[i][k];
}
for(int i = 1; i < n; i++) printf("%.3f ", a[i][n+1]/a[i][i]);
printf("%.3f", a[n][n+1]/a[n][n]);
return 0;
}