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

#include <nag.h>
#include <nagx04.h>
#include <nagad.h>
#include <math.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 << "F03BN_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;
  Integer *ipiv=0;
  a    =  new Complex [n*n];  
  ipiv =  new Integer [n];  
  
  // Read the matrix A
  double dr, di;
  for (int i = 0; i<n; ++i) {
    for (int j = 0; j<n; ++j) {
      cin >> dr >> di;
      Integer k = i + j*n;
      a[k].re = dr;
      a[k].im = di;
    }
  }

  // Print matrix A
  cout << endl;
  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;
  f07ar_p0w_f_(ad_handle,n,n,a,n,ipiv,ifail);

  // Print Factorization of A
  cout << endl;
  // NagError  fail;
  INIT_FAIL(fail);
  x04dac(Nag_ColMajor,Nag_GeneralMatrix,Nag_NonUnitDiag,n,n,a,n,
         "  Array A after factorization",0,&fail);

  Complex d;
  Integer id[2];
  ifail = 0;
  f03bn_p0w_f_(ad_handle,n,a,n,ipiv,d,id,ifail);

  dr = d.re;
  di = d.im;
  cout << "d = (" << dr << "," << di << ") id = ";
  cout << id[0] << ", " << id[1] << endl;
  dr = dr*pow(2.0,id[0]);
  di = di*pow(2.0,id[1]);
  cout << "\n value of determinant = (" << dr << "," << di << ")" << endl;

  delete [] a;
  delete [] ipiv;

  return exit_status;
}