```/* nag_matop_complex_gen_matrix_fun_std (f01fkc) Example Program.
*
* Copyright 2019 Numerical Algorithms Group.
*
* Mark 27.0, 2019.
*/

#include <nag.h>

int main(void)
{
/* Scalars */
Integer exit_status = 0;
Integer i, j, n, pda;

/* Arrays */
Complex *a = 0;
char nag_enum_arg[10];

/* Nag Types */
Nag_OrderType order;
Nag_MatFunType fun;
NagError fail;

INIT_FAIL(fail);

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

/* Output preamble */
printf("nag_matop_complex_gen_matrix_fun_std (f01fkc) ");
printf("Example Program Results\n\n");
fflush(stdout);

/* Skip heading in data file */
scanf("%*[^\n]");

/* Read in the problem size and the required function */
scanf("%" NAG_IFMT "%9s%*[^\n]", &n, nag_enum_arg);
pda = n;

/* nag_enum_name_to_value (x04nac)
* Converts Nag enum member name to value
*/
fun = (Nag_MatFunType) nag_enum_name_to_value(nag_enum_arg);

if (!(a = NAG_ALLOC((pda) * (n), Complex)))
{
printf("Allocation failure\n");
exit_status = -1;
goto END;
}

/* Read in the matrix a 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]");

/* Find the matrix function using
* nag_matop_complex_gen_matrix_fun_std (f01fkc)
* Complex matrix function
*/
nag_matop_complex_gen_matrix_fun_std(order, fun, n, a, pda, &fail);
if (fail.code != NE_NOERROR) {
printf("Error from nag_matop_complex_gen_matrix_fun_std (f01fkc)\n%s\n",
fail.message);
exit_status = 1;
goto END;
}

/* Print solution using
* nag_file_print_matrix_complex_gen (x04dac)
* Print complex general matrix (easy to use)
*/
nag_file_print_matrix_complex_gen(order, Nag_GeneralMatrix, Nag_NonUnitDiag,
n, n, a, n, "f(A)", NULL, &fail);
if (fail.code != NE_NOERROR) {
printf("Error from nag_file_print_matrix_complex_gen (x04dac)\n%s\n",
fail.message);
exit_status = 2;
goto END;
}

END:
NAG_FREE(a);
return exit_status;
}
```