/* F07AW_P0W_F C++ Header Example Program.
 *
 * Copyright 2023 Numerical Algorithms Group.
 * Mark 29.0, 2023.
 */

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

int main()
{
  int               exit_status = 0;
  nag::ad::handle_t ad_handle;
  Integer           ifail = 0;

  cout << "F07AW_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;
  cin >> n;

  // Allocate arrays containing A and its factorized form, B
  // and the solution X.
  Complex *a = 0, *work = 0;
  Integer *ipiv  = 0;
  Integer  lwork = 64 * n;
  a              = new Complex[n * n];
  work           = new Complex[lwork];
  ipiv           = new Integer[n];

  // Read the matrix A, register and copy
  double dr, di;
  double aa;
  for (int i = 0; i < n; ++i)
  {
    for (int j = 0; j < n; ++j)
    {
      Integer k = i + j * n;
      cin >> dr >> di;
      a[k].re = dr;
      a[k].im = di;
    }
  }

  // Print matrix A
  NagError fail;
  INIT_FAIL(fail);
  x04dac(Nag_ColMajor, Nag_GeneralMatrix, Nag_NonUnitDiag, n, n, a, n, "  A", 0,
         &fail);

  // Factorize the matrix A
  ifail = 0;
  nag::ad::f07ar(ad_handle, n, n, a, n, ipiv, ifail);

  // Invert A
  ifail = 0;
  nag::ad::f07aw(ad_handle, n, a, n, ipiv, work, lwork, ifail);

  cout << endl;
  // NagError  fail;
  INIT_FAIL(fail);
  x04dac(Nag_ColMajor, Nag_GeneralMatrix, Nag_NonUnitDiag, n, n, a, n,
         "  Inverse", 0, &fail);

  delete[] a;
  delete[] work;
  delete[] ipiv;
  return exit_status;
}