题目描述
题解
按照题意列出方程组
(x1−x)2+(y1−y)2+(z1−z)2=r2
(x2−x)2+(y2−y)2+(z2−z)2=r2
…
(xn+1−x)2+(yn+1−y)2+(zn+1−z)2=r2
各项展开
x21+x2+y21+y2+z21+z2=2x1x+2y1y+2z1z+r2
x22+x2+y22+y2+z22+z2=2x2x+2y2y+2z2z+r2
…
x2n+1+x2+y2n+1+y2+z2n+1+z2=2xn+1x+2yn+1y+2zn+1z+r2
用每个方程与第一个方程左右分别做差就可以把所有未知量的二次项全部消去
x22−x21+y22−y21+z22−z21=2(x2−x1)x+2(y2−y1)y+2(z2−z1)z
x23−x21+y23−y21+z23−z21=2(x3−x1)x+2(y3−y1)y+2(z3−z1)z
…
x2n+1−x21+y2n+1−y21+z2n+1−z21=2(xn+1−x1)x+2(yn+1−y1)y+2(zn+1−z1)z
得到n个线性方程
然后用高斯消元求解即可
代码
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;
#define N 20
const double eps=1e-6;
int n;
double x[N],a[N][N],b[N],ans[N];
void gauss()
{
for (int i=1;i<=n;++i)
{
int num=i;
for (int j=i+1;j<=n;++j)
if (fabs(a[j][i])>fabs(a[num][i]))
num=j;
for (int j=1;j<=n;++j) swap(a[i][j],a[num][j]);
swap(b[i],b[num]);
for (int j=i+1;j<=n;++j)
{
if (fabs(a[j][i])<=eps) continue;
double t=a[j][i]/a[i][i];
for (int k=1;k<=n;++k)
a[j][k]-=a[i][k]*t;
b[j]-=b[i]*t;
}
}
for (int i=n;i>=1;--i)
{
ans[i]=b[i]/a[i][i];
for (int j=i;j>=1;--j)
b[j]-=ans[i]*a[j][i];
}
}
int main()
{
scanf("%d",&n);
for (int i=1;i<=n;++i) scanf("%lf",&x[i]);
for (int i=1;i<=n;++i)
{
for (int j=1;j<=n;++j)
{
scanf("%lf",&x[0]);
a[i][j]=2*(x[0]-x[j]);
b[i]+=x[0]*x[0]-x[j]*x[j];
}
}
gauss();
for (int i=1;i<=n;++i) printf("%.3lf%c",ans[i]," \n"[i==n]);
}