NAG Library Manual, Mark 29
```/* nag_lapacklin_zgetrs (f07asc) Example Program.
*
* Copyright 2023 Numerical Algorithms Group.
*
* Mark 29.0, 2023.
*/

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

int main(void) {
/* Scalars */
Integer i, ipiv_len, j, n, nrhs, pda, pdb;
Integer exit_status = 0;
NagError fail;
Nag_OrderType order;
/* Arrays */
Complex *a = 0, *b = 0;
Integer *ipiv = 0;

#ifdef NAG_COLUMN_MAJOR
#define A(I, J) a[(J - 1) * pda + I - 1]
#define B(I, J) b[(J - 1) * pdb + I - 1]
order = Nag_ColMajor;
#else
#define A(I, J) a[(I - 1) * pda + J - 1]
#define B(I, J) b[(I - 1) * pdb + J - 1]
order = Nag_RowMajor;
#endif

INIT_FAIL(fail);

printf("nag_lapacklin_zgetrs (f07asc) Example Program Results\n\n");
/* Skip heading in data file */
scanf("%*[^\n] ");
scanf("%" NAG_IFMT "%" NAG_IFMT "%*[^\n] ", &n, &nrhs);
#ifdef NAG_COLUMN_MAJOR
pda = n;
pdb = n;
#else
pda = n;
pdb = nrhs;
#endif
ipiv_len = n;

/* Allocate memory */
if (!(a = NAG_ALLOC(n * n, Complex)) || !(b = NAG_ALLOC(n * nrhs, Complex)) ||
!(ipiv = NAG_ALLOC(ipiv_len, Integer))) {
printf("Allocation failure\n");
exit_status = -1;
goto END;
}

/* Read A and B from data file */
for (i = 1; i <= n; ++i) {
for (j = 1; j <= n; ++j) {
scanf(" ( %lf , %lf )", &A(i, j).re, &A(i, j).im);
}
}
scanf("%*[^\n] ");
for (i = 1; i <= n; ++i) {
for (j = 1; j <= nrhs; ++j)
scanf(" ( %lf , %lf )", &B(i, j).re, &B(i, j).im);
}
scanf("%*[^\n] ");

/* Factorize A */
/* nag_lapacklin_zgetrf (f07arc).
* LU factorization of complex m by n matrix
*/
nag_lapacklin_zgetrf(order, n, n, a, pda, ipiv, &fail);
if (fail.code != NE_NOERROR) {
printf("Error from nag_lapacklin_zgetrf (f07arc).\n%s\n", fail.message);
exit_status = 1;
goto END;
}

/* Compute solution */
/* nag_lapacklin_zgetrs (f07asc).
* Solution of complex system of linear equations, multiple
* right-hand sides, matrix already factorized by nag_lapacklin_zgetrf
* (f07arc)
*/
nag_lapacklin_zgetrs(order, Nag_NoTrans, n, nrhs, a, pda, ipiv, b, pdb,
&fail);
if (fail.code != NE_NOERROR) {
printf("Error from nag_lapacklin_zgetrs (f07asc).\n%s\n", fail.message);
exit_status = 1;
goto END;
}

/* Print solution */
/* nag_file_print_matrix_complex_gen_comp (x04dbc).
* Print complex general matrix (comprehensive)
*/
fflush(stdout);
nag_file_print_matrix_complex_gen_comp(
order, Nag_GeneralMatrix, Nag_NonUnitDiag, n, nrhs, b, pdb,
Nag_BracketForm, "%7.4f", "Solution(s)", Nag_IntegerLabels, 0,
Nag_IntegerLabels, 0, 80, 0, 0, &fail);
if (fail.code != NE_NOERROR) {
printf("Error from nag_file_print_matrix_complex_gen_comp (x04dbc).\n%s\n",
fail.message);
exit_status = 1;
goto END;
}
END:
NAG_FREE(a);
NAG_FREE(b);
NAG_FREE(ipiv);
return exit_status;
}
```