/* nag_real_lin_eqn (f04arc) Example Program.
 *
 * Copyright 1990 Numerical Algorithms Group.
 *
 * Mark 2 revised, 1992.
 * Mark 8 revised, 2004.
 */

#include <nag.h>
#include <stdio.h>
#include <nag_stdlib.h>
#include <nagf04.h>

#define A(I, J) a[(I) *tda + J]
int main(void)
{

  Integer  exit_status = 0, i, j, n, tda;
  NagError fail;
  double   *a = 0, *b = 0, *x = 0;

  INIT_FAIL(fail);

  printf("nag_real_lin_eqn (f04arc) Example Program Results\n");
  /* Skip heading in data file */
  scanf("%*[^\n]");
  scanf("%ld", &n);
  if (n >= 1)
    {
      if (!(a = NAG_ALLOC(n*n, double)) ||
          !(b = NAG_ALLOC(n, double)) ||
          !(x = NAG_ALLOC(n, double)))
        {
          printf("Allocation failure\n");
          exit_status = -1;
          goto END;
        }
      tda = n;
    }
  else
    {
      printf("Invalid n.\n");
      exit_status = 1;
      return exit_status;
    }
  for (i = 0; i < n; i++)
    for (j = 0; j < n; j++)
      scanf("%lf", &A(i, j));
  for (i = 0; i < n; i++)
    scanf("%lf", &b[i]);
  /* nag_real_lin_eqn (f04arc).
   * Approximate solution of real simultaneous linear
   * equations, one right-hand side
   */
  nag_real_lin_eqn(n, a, tda, b, x, &fail);
  if (fail.code != NE_NOERROR)
    {
      printf("Error from nag_real_lin_eqn (f04arc).\n%s\n",
              fail.message);
      exit_status = 1;
      goto END;
    }

  printf("Solution\n");
  for (i = 0; i < n; i++)
    printf("%9.4f\n", x[i]);
 END:
  if (a) NAG_FREE(a);
  if (b) NAG_FREE(b);
  if (x) NAG_FREE(x);
  return exit_status;
}