#include <math.h>

#include <stdlib.h>

#include <string.h>

#include <stdio.h>

#include <complex.h>

#ifdef complex

#undef complex

#endif

#ifdef I

#undef I

#endif

#if defined(_WIN64)

typedef long long BLASLONG;

typedef unsigned long long BLASULONG;

#else

typedef long BLASLONG;

typedef unsigned long BLASULONG;

#endif

#ifdef LAPACK_ILP64

typedef BLASLONG blasint;

#if defined(_WIN64)

#define blasabs(x) llabs(x)

#else

#define blasabs(x) labs(x)

#endif

#else

typedef int blasint;

#define blasabs(x) abs(x)

#endif

typedef blasint integer;

typedef unsigned int uinteger;

typedef char *address;

typedef short int shortint;

typedef float real;

typedef double doublereal;

typedef struct { real r, i; } complex;

typedef struct { doublereal r, i; } doublecomplex;

#ifdef _MSC_VER

static inline _Fcomplex Cf(complex *z) {_Fcomplex zz={z->r , z->i}; return zz;}

static inline _Dcomplex Cd(doublecomplex *z) {_Dcomplex zz={z->r , z->i};return zz;}

static inline _Fcomplex * _pCf(complex *z) {return (_Fcomplex*)z;}

static inline _Dcomplex * _pCd(doublecomplex *z) {return (_Dcomplex*)z;}

#else

static inline _Complex float Cf(complex *z) {return z->r + z->i*_Complex_I;}

static inline _Complex double Cd(doublecomplex *z) {return z->r + z->i*_Complex_I;}

static inline _Complex float * _pCf(complex *z) {return (_Complex float*)z;}

static inline _Complex double * _pCd(doublecomplex *z) {return (_Complex double*)z;}

#endif

#define pCf(z) (*_pCf(z))

#define pCd(z) (*_pCd(z))

typedef blasint logical;

typedef char logical1;

typedef char integer1;

#define TRUE_ (1)

#define FALSE_ (0)

/* Extern is for use with -E */

#ifndef Extern

#define Extern extern

#endif

/* I/O stuff */

typedef int flag;

typedef int ftnlen;

typedef int ftnint;

/*external read, write*/

typedef struct

{ flag cierr;

  ftnint ciunit;

  flag ciend;

  char *cifmt;

  ftnint cirec;

} cilist;

/*internal read, write*/

typedef struct

{ flag icierr;

  char *iciunit;

  flag iciend;

  char *icifmt;

  ftnint icirlen;

  ftnint icirnum;

} icilist;

/*open*/

typedef struct

{ flag oerr;

  ftnint ounit;

  char *ofnm;

  ftnlen ofnmlen;

  char *osta;

  char *oacc;

  char *ofm;

  ftnint orl;

  char *oblnk;

} olist;

/*close*/

typedef struct

{ flag cerr;

  ftnint cunit;

  char *csta;

} cllist;

/*rewind, backspace, endfile*/

typedef struct

{ flag aerr;

  ftnint aunit;

} alist;

/* inquire */

typedef struct

{ flag inerr;

  ftnint inunit;

  char *infile;

  ftnlen infilen;

  ftnint  *inex;  /*parameters in standard's order*/

  ftnint  *inopen;

  ftnint  *innum;

  ftnint  *innamed;

  char  *inname;

  ftnlen  innamlen;

  char  *inacc;

  ftnlen  inacclen;

  char  *inseq;

  ftnlen  inseqlen;

  char  *indir;

  ftnlen  indirlen;

  char  *infmt;

  ftnlen  infmtlen;

  char  *inform;

  ftnint  informlen;

  char  *inunf;

  ftnlen  inunflen;

  ftnint  *inrecl;

  ftnint  *innrec;

  char  *inblank;

  ftnlen  inblanklen;

} inlist;

#define VOID void

union Multitype { /* for multiple entry points */

  integer1 g;

  shortint h;

  integer i;

  /* longint j; */

  real r;

  doublereal d;

  complex c;

  doublecomplex z;

  };

typedef union Multitype Multitype;

struct Vardesc {  /* for Namelist */

  char *name;

  char *addr;

  ftnlen *dims;

  int  type;

  };

typedef struct Vardesc Vardesc;

struct Namelist {

  char *name;

  Vardesc **vars;

  int nvars;

  };

typedef struct Namelist Namelist;

#define abs(x) ((x) >= 0 ? (x) : -(x))

#define dabs(x) (fabs(x))

#define f2cmin(a,b) ((a) <= (b) ? (a) : (b))

#define f2cmax(a,b) ((a) >= (b) ? (a) : (b))

#define dmin(a,b) (f2cmin(a,b))

#define dmax(a,b) (f2cmax(a,b))

#define bit_test(a,b) ((a) >> (b) & 1)

#define bit_clear(a,b)  ((a) & ~((uinteger)1 << (b)))

#define bit_set(a,b)  ((a) |  ((uinteger)1 << (b)))

#define abort_() { sig_die("Fortran abort routine called", 1); }

#define c_abs(z) (cabsf(Cf(z)))

#define c_cos(R,Z) { pCf(R)=ccos(Cf(Z)); }

#ifdef _MSC_VER

#define c_div(c, a, b) {Cf(c)._Val[0] = (Cf(a)._Val[0]/Cf(b)._Val[0]); Cf(c)._Val[1]=(Cf(a)._Val[1]/Cf(b)._Val[1]);}

#define z_div(c, a, b) {Cd(c)._Val[0] = (Cd(a)._Val[0]/Cd(b)._Val[0]); Cd(c)._Val[1]=(Cd(a)._Val[1]/df(b)._Val[1]);}

#else

#define c_div(c, a, b) {pCf(c) = Cf(a)/Cf(b);}

#define z_div(c, a, b) {pCd(c) = Cd(a)/Cd(b);}

#endif

#define c_exp(R, Z) {pCf(R) = cexpf(Cf(Z));}

#define c_log(R, Z) {pCf(R) = clogf(Cf(Z));}

#define c_sin(R, Z) {pCf(R) = csinf(Cf(Z));}

//#define c_sqrt(R, Z) {*(R) = csqrtf(Cf(Z));}

#define c_sqrt(R, Z) {pCf(R) = csqrtf(Cf(Z));}

#define d_abs(x) (fabs(*(x)))

#define d_acos(x) (acos(*(x)))

#define d_asin(x) (asin(*(x)))

#define d_atan(x) (atan(*(x)))

#define d_atn2(x, y) (atan2(*(x),*(y)))

#define d_cnjg(R, Z) { pCd(R) = conj(Cd(Z)); }

#define r_cnjg(R, Z) { pCf(R) = conjf(Cf(Z)); }

#define d_cos(x) (cos(*(x)))

#define d_cosh(x) (cosh(*(x)))

#define d_dim(__a, __b) ( *(__a) > *(__b) ? *(__a) - *(__b) : 0.0 )

#define d_exp(x) (exp(*(x)))

#define d_imag(z) (cimag(Cd(z)))

#define r_imag(z) (cimagf(Cf(z)))

#define d_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))

#define r_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))

#define d_lg10(x) ( 0.43429448190325182765 * log(*(x)) )

#define r_lg10(x) ( 0.43429448190325182765 * log(*(x)) )

#define d_log(x) (log(*(x)))

#define d_mod(x, y) (fmod(*(x), *(y)))

#define u_nint(__x) ((__x)>=0 ? floor((__x) + .5) : -floor(.5 - (__x)))

#define d_nint(x) u_nint(*(x))

#define u_sign(__a,__b) ((__b) >= 0 ? ((__a) >= 0 ? (__a) : -(__a)) : -((__a) >= 0 ? (__a) : -(__a)))

#define d_sign(a,b) u_sign(*(a),*(b))

#define r_sign(a,b) u_sign(*(a),*(b))

#define d_sin(x) (sin(*(x)))

#define d_sinh(x) (sinh(*(x)))

#define d_sqrt(x) (sqrt(*(x)))

#define d_tan(x) (tan(*(x)))

#define d_tanh(x) (tanh(*(x)))

#define i_abs(x) abs(*(x))

#define i_dnnt(x) ((integer)u_nint(*(x)))

#define i_len(s, n) (n)

#define i_nint(x) ((integer)u_nint(*(x)))

#define i_sign(a,b) ((integer)u_sign((integer)*(a),(integer)*(b)))

#define s_cat(lpp, rpp, rnp, np, llp) {   ftnlen i, nc, ll; char *f__rp, *lp;   ll = (llp); lp = (lpp);   for(i=0; i < (int)*(np); ++i) {           nc = ll;          if((rnp)[i] < nc) nc = (rnp)[i];          ll -= nc;           f__rp = (rpp)[i];           while(--nc >= 0) *lp++ = *(f__rp)++;         }  while(--ll >= 0) *lp++ = ' '; }

#define s_cmp(a,b,c,d) ((integer)strncmp((a),(b),f2cmin((c),(d))))

#define s_copy(A,B,C,D) { int __i,__m; for (__i=0, __m=f2cmin((C),(D)); __i<__m && (B)[__i] != 0; ++__i) (A)[__i] = (B)[__i]; }

#define sig_die(s, kill) { exit(1); }

#define s_stop(s, n) {exit(0);}

#define z_abs(z) (cabs(Cd(z)))

#define z_exp(R, Z) {pCd(R) = cexp(Cd(Z));}

#define z_sqrt(R, Z) {pCd(R) = csqrt(Cd(Z));}

#define myexit_() break;

#define mycycle() continue;

#define myceiling(w) {ceil(w)}

#define myhuge(w) {HUGE_VAL}

//#define mymaxloc_(w,s,e,n) {if (sizeof(*(w)) == sizeof(double)) dmaxloc_((w),*(s),*(e),n); else dmaxloc_((w),*(s),*(e),n);}

#define mymaxloc(w,s,e,n) {dmaxloc_(w,*(s),*(e),n)}

/*  -- translated by f2c (version 20000121).

   You must link the resulting object file with the libraries:

  -lf2c -lm   (in that order)

*/

/* Table of constant values */

static integer c__1 = 1;

static integer c_n1 = -1;

static integer c__2 = 2;

static real c_b20 = -1.f;

static real c_b22 = 1.f;

/* > \brief \b SGETRI */

/*  =========== DOCUMENTATION =========== */

/* Online html documentation available at */

/*            http://www.netlib.org/lapack/explore-html/ */

/* > \htmlonly */

/* > Download SGETRI + dependencies */

/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/sgetri.

f"> */

/* > [TGZ]</a> */

/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/sgetri.

f"> */

/* > [ZIP]</a> */

/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/sgetri.

f"> */

/* > [TXT]</a> */

/* > \endhtmlonly */

/*  Definition: */

/*  =========== */

/*       SUBROUTINE SGETRI( N, A, LDA, IPIV, WORK, LWORK, INFO ) */

/*       INTEGER            INFO, LDA, LWORK, N */

/*       INTEGER            IPIV( * ) */

/*       REAL               A( LDA, * ), WORK( * ) */

/* > \par Purpose: */

/*  ============= */

/* > */

/* > \verbatim */

/* > */

/* > SGETRI computes the inverse of a matrix using the LU factorization */

/* > computed by SGETRF. */

/* > */

/* > This method inverts U and then computes inv(A) by solving the system */

/* > inv(A)*L = inv(U) for inv(A). */

/* > \endverbatim */

/*  Arguments: */

/*  ========== */

/* > \param[in] N */

/* > \verbatim */

/* >          N is INTEGER */

/* >          The order of the matrix A.  N >= 0. */

/* > \endverbatim */

/* > */

/* > \param[in,out] A */

/* > \verbatim */

/* >          A is REAL array, dimension (LDA,N) */

/* >          On entry, the factors L and U from the factorization */

/* >          A = P*L*U as computed by SGETRF. */

/* >          On exit, if INFO = 0, the inverse of the original matrix A. */

/* > \endverbatim */

/* > */

/* > \param[in] LDA */

/* > \verbatim */

/* >          LDA is INTEGER */

/* >          The leading dimension of the array A.  LDA >= f2cmax(1,N). */

/* > \endverbatim */

/* > */

/* > \param[in] IPIV */

/* > \verbatim */

/* >          IPIV is INTEGER array, dimension (N) */

/* >          The pivot indices from SGETRF; for 1<=i<=N, row i of the */

/* >          matrix was interchanged with row IPIV(i). */

/* > \endverbatim */

/* > */

/* > \param[out] WORK */

/* > \verbatim */

/* >          WORK is REAL array, dimension (MAX(1,LWORK)) */

/* >          On exit, if INFO=0, then WORK(1) returns the optimal LWORK. */

/* > \endverbatim */

/* > */

/* > \param[in] LWORK */

/* > \verbatim */

/* >          LWORK is INTEGER */

/* >          The dimension of the array WORK.  LWORK >= f2cmax(1,N). */

/* >          For optimal performance LWORK >= N*NB, where NB is */

/* >          the optimal blocksize returned by ILAENV. */

/* > */

/* >          If LWORK = -1, then a workspace query is assumed; the routine */

/* >          only calculates the optimal size of the WORK array, returns */

/* >          this value as the first entry of the WORK array, and no error */

/* >          message related to LWORK is issued by XERBLA. */

/* > \endverbatim */

/* > */

/* > \param[out] INFO */

/* > \verbatim */

/* >          INFO is INTEGER */

/* >          = 0:  successful exit */

/* >          < 0:  if INFO = -i, the i-th argument had an illegal value */

/* >          > 0:  if INFO = i, U(i,i) is exactly zero; the matrix is */

/* >                singular and its inverse could not be computed. */

/* > \endverbatim */

/*  Authors: */

/*  ======== */

/* > \author Univ. of Tennessee */

/* > \author Univ. of California Berkeley */

/* > \author Univ. of Colorado Denver */

/* > \author NAG Ltd. */

/* > \date December 2016 */

/* > \ingroup realGEcomputational */

/*  ===================================================================== */

/* Subroutine */ void sgetri_(integer *n, real *a, integer *lda, integer *ipiv,

   real *work, integer *lwork, integer *info)

{

    /* System generated locals */

    integer a_dim1, a_offset, i__1, i__2, i__3;

    /* Local variables */

    integer i__, j, nbmin;

    extern /* Subroutine */ void sgemm_(char *, char *, integer *, integer *, 

      integer *, real *, real *, integer *, real *, integer *, real *, 

      real *, integer *), sgemv_(char *, integer *, 

      integer *, real *, real *, integer *, real *, integer *, real *, 

      real *, integer *), sswap_(integer *, real *, integer *, 

      real *, integer *), strsm_(char *, char *, char *, char *, 

      integer *, integer *, real *, real *, integer *, real *, integer *

      );

    integer jb, nb, jj, jp, nn;

    extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);

    extern integer ilaenv_(integer *, char *, char *, integer *, integer *, 

      integer *, integer *, ftnlen, ftnlen);

    integer ldwork, lwkopt;

    logical lquery;

    extern /* Subroutine */ int strtri_(char *, char *, integer *, real *, 

      integer *, integer *);

    integer iws;

/*  -- LAPACK computational routine (version 3.7.0) -- */

/*  -- LAPACK is a software package provided by Univ. of Tennessee,    -- */

/*  -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */

/*     December 2016 */

/*  ===================================================================== */

/*     Test the input parameters. */

    /* Parameter adjustments */

    a_dim1 = *lda;

    a_offset = 1 + a_dim1 * 1;

    a -= a_offset;

    --ipiv;

    --work;

    /* Function Body */

    *info = 0;

    nb = ilaenv_(&c__1, "SGETRI", " ", n, &c_n1, &c_n1, &c_n1, (ftnlen)6, (

      ftnlen)1);

    lwkopt = *n * nb;

    work[1] = (real) lwkopt;

    lquery = *lwork == -1;

    if (*n < 0) {

  *info = -1;

    } else if (*lda < f2cmax(1,*n)) {

  *info = -3;

    } else if (*lwork < f2cmax(1,*n) && ! lquery) {

  *info = -6;

    }

    if (*info != 0) {

  i__1 = -(*info);

  xerbla_("SGETRI", &i__1, (ftnlen)6);

  return;

    } else if (lquery) {

  return;

    }

/*     Quick return if possible */

    if (*n == 0) {

  return;

    }

/*     Form inv(U).  If INFO > 0 from STRTRI, then U is singular, */

/*     and the inverse is not computed. */

    strtri_("Upper", "Non-unit", n, &a[a_offset], lda, info);

    if (*info > 0) {

  return;

    }

    nbmin = 2;

    ldwork = *n;

    if (nb > 1 && nb < *n) {

/* Computing MAX */

  i__1 = ldwork * nb;

  iws = f2cmax(i__1,1);

  if (*lwork < iws) {

      nb = *lwork / ldwork;

/* Computing MAX */

      i__1 = 2, i__2 = ilaenv_(&c__2, "SGETRI", " ", n, &c_n1, &c_n1, &

        c_n1, (ftnlen)6, (ftnlen)1);

      nbmin = f2cmax(i__1,i__2);

  }

    } else {

  iws = *n;

    }

/*     Solve the equation inv(A)*L = inv(U) for inv(A). */

    if (nb < nbmin || nb >= *n) {

/*        Use unblocked code. */

  for (j = *n; j >= 1; --j) {

/*           Copy current column of L to WORK and replace with zeros. */

      i__1 = *n;

      for (i__ = j + 1; i__ <= i__1; ++i__) {

    work[i__] = a[i__ + j * a_dim1];

    a[i__ + j * a_dim1] = 0.f;

/* L10: */

      }

/*           Compute current column of inv(A). */

      if (j < *n) {

    i__1 = *n - j;

    sgemv_("No transpose", n, &i__1, &c_b20, &a[(j + 1) * a_dim1 

      + 1], lda, &work[j + 1], &c__1, &c_b22, &a[j * a_dim1 

      + 1], &c__1);

      }

/* L20: */

  }

    } else {

/*        Use blocked code. */

  nn = (*n - 1) / nb * nb + 1;

  i__1 = -nb;

  for (j = nn; i__1 < 0 ? j >= 1 : j <= 1; j += i__1) {

/* Computing MIN */

      i__2 = nb, i__3 = *n - j + 1;

      jb = f2cmin(i__2,i__3);

/*           Copy current block column of L to WORK and replace with */

/*           zeros. */

      i__2 = j + jb - 1;

      for (jj = j; jj <= i__2; ++jj) {

    i__3 = *n;

    for (i__ = jj + 1; i__ <= i__3; ++i__) {

        work[i__ + (jj - j) * ldwork] = a[i__ + jj * a_dim1];

        a[i__ + jj * a_dim1] = 0.f;

/* L30: */

    }

/* L40: */

      }

/*           Compute current block column of inv(A). */

      if (j + jb <= *n) {

    i__2 = *n - j - jb + 1;

    sgemm_("No transpose", "No transpose", n, &jb, &i__2, &c_b20, 

      &a[(j + jb) * a_dim1 + 1], lda, &work[j + jb], &

      ldwork, &c_b22, &a[j * a_dim1 + 1], lda);

      }

      strsm_("Right", "Lower", "No transpose", "Unit", n, &jb, &c_b22, &

        work[j], &ldwork, &a[j * a_dim1 + 1], lda);

/* L50: */

  }

    }

/*     Apply column interchanges. */

    for (j = *n - 1; j >= 1; --j) {

  jp = ipiv[j];

  if (jp != j) {

      sswap_(n, &a[j * a_dim1 + 1], &c__1, &a[jp * a_dim1 + 1], &c__1);

  }

/* L60: */

    }

    work[1] = (real) iws;

    return;

/*     End of SGETRI */

} /* sgetri_ */