/* nag_real_cholesky_skyline(f01mcc) Example Program
 *
 * Copyright 1996 Numerical Algorithms Group.
 *
 * Mark 4, 1996.
 */

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

#define NMAX 8
#define LALMAX 36

int main(void)
{
  Integer i, k, k1, k2, lal, n;
  double a[LALMAX], al[LALMAX], d[NMAX];
  Integer row[NMAX];
  static NagError fail;

  Vprintf("f01mcc Example Program Results\n");
  /* Skip heading in data file */
  Vscanf("%*[^\n]");
  Vscanf("%ld", &n);
  if (n<1 || n>NMAX)
    {
      Vfprintf(stderr,"n is out of range: n = %5ld\n", n);
      return EXIT_FAILURE;
    }
  for (i=0; i<n; i++)
    Vscanf("%ld", &row[i]);
  k2 = 0;
  for (i=0; i<n; ++i)
    {
      k1 = k2;
      k2 = k2+row[i];
      for (k=k1; k<k2; k++)
        Vscanf("%lf", &a[k]);
    }
  lal = k2;
  if (lal>LALMAX)
    {
      Vprintf("\n lal is out of range: lal = %ld\n", lal);
      return EXIT_FAILURE;
    }
  fail.print = TRUE;
  f01mcc(n, a, lal, row, al, d, &fail);
  Vprintf("\n");
  if (fail.code != NE_NOERROR)
    return EXIT_FAILURE;
  Vprintf("   i    d[i]   Row i of unit lower triangle\n\n");
  k2 = 0;
  for (i=0; i<n; ++i)
    {
      k1 = k2;
      k2 = k2+row[i];
      Vprintf(" %3ld%8.3f", i, d[i]);
      for (k=k1; k<k2; k++)
        Vprintf("%8.3f", al[k]);
      Vprintf("\n");
    }
  return EXIT_SUCCESS;
}