/* F07FE_P0W_F C++ Header Example Program.
 *
 * Copyright 2019 Numerical Algorithms Group.
 * Mark 27, 2019.
 */

#include <nag.h>
#include <nagx04.h>
#include <nagad.h>
#include <stdio.h>
#include <string>
#include <iostream>
using namespace std;

int main(void)
{
  int       exit_status = 0;
  void      *ad_handle = 0;
  Integer   ifail = 0;

  cout << "F07FE_P0W_F C++ Header Example Program Results\n\n";
  // Skip heading in data file
  string mystr;
  getline (cin, mystr);

  // Read problem size and number of right-hand-sides 
  Integer n, nrhs;
  cin >> n;
  cin >> nrhs;

  // Allocate arrays containing A and its factorized form, B
  // and the solution X.
  double *a=0, *b=0;
  a   = new double [n*n];
  b   = new double [n*nrhs];

  // Read the lower triangular matrix A, register and copy
  double dd;
  for (int i = 0; i<n; ++i) {
    for (int j = 0; j<=i; ++j) {
      int k = i + j*n;
      cin >> a[k];
    }
  }
  // Read the right-hand-sides, register and copy
  for (int i = 0; i<n; ++i) {
    for (int j = 0; j<nrhs; ++j) {
      int k = i + j*n;
      cin >> b[k];
    }
  }

  // Factorize the matrix A
  ifail = 0;
  f07fd_p0w_f_(ad_handle,"L",n,a,n,ifail,1);

  // Solve the system
  ifail = 0;
  f07fe_p0w_f_(ad_handle,"L",n,nrhs,a,n,b,n,ifail,1);
  
  // Print solution
  cout << endl;
  NagError  fail;
  INIT_FAIL(fail);
  x04cac(Nag_ColMajor,Nag_GeneralMatrix,Nag_NonUnitDiag,n,nrhs,b,n,
         "  Solution",0,&fail);

  delete [] a;
  delete [] b;
  return exit_status;
}