16 for (j = 0, s = 0., p = a; j <
n; ++j, p += n + 1)
17 if ((t = fabs(*p)) > s)
20 for (j = n - 1, p = a + n * n - 1; j >= 0; --j, p -= n + 1) {
21 for (k = j + 1, q = p + 1; k <
n;)
22 b[j] -= b[k++] * *q++;
int solvru(double *a, double *b, int n)