一个很重要的关于double输出问题的提醒,就是浮点数里面是含有-0的,因此像此题这样的,就会出现一种正着的运算方式求出的是+0.00,另一种倒着的运算方式求出的是-0.00
如果你的程序得出的结果与测试文件中的恰好相反,那么你的RP就太差了,有人说单独判断是否小于eps,其实如果出题人没有考虑到这一点,按照正常的思路给出的结果是-0.00
那么你虽然是对的,依旧悲剧,总之,看RP,只能多次尝试。
/*
* File: main.cpp
* Author: hit-acm
*
* Created on October 2, 2012, 1:44 PM
*/
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
using namespace std;
const int MAXN = 12;
const double eps = 1e-6;
double mat[MAXN][MAXN];
double x[MAXN];
double ans[MAXN];
double a[MAXN][MAXN];
double D[MAXN];
void set_map()
{
for (int i = 0; i < 12; i++)
{
ans[i] = D[i] * D[i];
for (int j = 0; j < 11; j++)
{
ans[i] -= a[i][j] * a[i][j];
}
}
for (int i = 0; i < 12; i++)
{
for (int j = 0; j < 11; j++)
{
mat[i][j] = -2 * a[i][j];
}
}
for (int i = 0; i < 11; i++)
{
ans[i] -= ans[11];
}
for (int i = 0; i < 11; i++)
{
for (int j = 0; j < 11; j++)
{
mat[i][j] -= mat[11][j];
}
}
}
bool guass(int size)
{
int i, j;
for (i = 0, j = 0; i < size && j < size; i++, j++)
{
int temp = i;
double ss = mat[i][j];
for (int k = i + 1; k < size; k++)
{
if (fabs(mat[k][j]) > fabs(ss))
{
ss = mat[k][j];
temp = k;
}
}
for (int p = j; p < size; p++)
{
swap(mat[i][p], mat[temp][p]);
}
swap(ans[i], ans[temp]);
for (int k = i + 1; k < size; k++)
{
double t = mat[k][j] / mat[i][j];
for (int p = j; p < size; p++)
{
mat[k][p] -= mat[i][p] * t;
}
ans[k] -= ans[i] * t;
}
}
for (int i = size - 1; i >= 0; i--)
{
x[i] = ans[i];
for (int j = size - 1; j > i; j--)
{
x[i] -= mat[i][j] * x[j];
}
x[i] /= mat[i][i];
}
return true;
}
int main()
{
int T;
scanf("%d", &T);
while (T--)
{
for (int i = 0; i < 12; i++)
{
for (int j = 0; j < 11; j++)
{
scanf("%lf", &a[i][j]);
}
scanf("%lf", &D[i]);
}
set_map();
guass(11);
for (int i = 0; i < 11; i++)
{
if (i == 0)
{
if(fabs(x[i])<eps)
{
printf("0.00");
}
else
{
printf("%.2lf", x[i]);
}
}
else
{
if(fabs(x[i])<eps)
{
printf(" 0.00");
}
else
{
printf(" %.2lf", x[i]);
}
}
}
putchar('\n');
}
return 0;
}