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

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

int main(void)
{

/* Scalars */
Complex alpha, beta;
Integer aplen, exit_status, i, incx, incy, j, n, xlen, ylen;

/* Arrays */
Complex *ap = 0, *x = 0, *y = 0;
char nag_enum_arg[40];

/* Nag Types */
NagError fail;
Nag_OrderType order;
Nag_UploType uplo;

#ifdef NAG_COLUMN_MAJOR
#define A_UPPER(I, J) ap[J*(J-1)/2 + I - 1]
#define A_LOWER(I, J) ap[(2*n-J)*(J-1)/2 + I - 1]
order = Nag_ColMajor;
#else
#define A_LOWER(I, J) ap[I*(I-1)/2 + J - 1]
#define A_UPPER(I, J) ap[(2*n-I)*(I-1)/2 + J - 1]
order = Nag_RowMajor;
#endif

exit_status = 0;
INIT_FAIL(fail);

printf("nag_blast_zspmv (f16tcc) Example Program Results\n\n");

/* Skip heading in data file */
scanf("%*[^\n] ");
/* Read the problem dimension */
scanf("%" NAG_IFMT "%*[^\n] ", &n);
scanf("%39s%*[^\n] ", nag_enum_arg);
/* nag_enum_name_to_value (x04nac).
* Converts NAG enum member name to value
*/
uplo = (Nag_UploType) nag_enum_name_to_value(nag_enum_arg);
scanf(" ( %lf , %lf ) ( %lf , %lf )%*[^\n] ",
&alpha.re, &alpha.im, &beta.re, &beta.im);
scanf("%" NAG_IFMT "%" NAG_IFMT "%*[^\n] ", &incx, &incy);

aplen = n * (n + 1) / 2;
xlen = MAX(1, 1 + (n - 1) * ABS(incx));
ylen = MAX(1, 1 + (n - 1) * ABS(incy));

if (n > 0) {
/* Allocate memory */
if (!(ap = NAG_ALLOC(aplen, Complex)) ||
!(x = NAG_ALLOC(xlen, Complex)) || !(y = NAG_ALLOC(ylen, Complex)))
{
printf("Allocation failure\n");
exit_status = -1;
goto END;
}
}
else {
printf("Invalid n\n");
exit_status = 1;
return exit_status;
}

/* Read A from data file */
if (uplo == Nag_Upper) {
for (i = 1; i <= n; ++i) {
for (j = i; j <= n; ++j)
scanf(" ( %lf , %lf )", &A_UPPER(i, j).re, &A_UPPER(i, j).im);
}
scanf("%*[^\n] ");
}
else {
for (i = 1; i <= n; ++i) {
for (j = 1; j <= i; ++j)
scanf(" ( %lf , %lf ) ", &A_LOWER(i, j).re, &A_LOWER(i, j).im);
}
scanf("%*[^\n] ");
}

/* Input vectors x and y */
for (i = 1; i <= xlen; ++i)
scanf(" ( %lf , %lf )%*[^\n] ", &x[i - 1].re, &x[i - 1].im);
for (i = 1; i <= ylen; ++i)
scanf(" ( %lf , %lf )%*[^\n] ", &y[i - 1].re, &y[i - 1].im);

/* nag_blast_zspmv (f16tcc).
* Complex symmetric packed storage matrix-vector multiply.
*
*/
nag_blast_zspmv(order, uplo, n, alpha, ap, x, incx, beta, y, incy, &fail);
if (fail.code != NE_NOERROR) {
printf("Error from nag_blast_zspmv.\n%s\n", fail.message);
exit_status = 1;
goto END;
}

/* Print output vector y */
printf("%s\n", "  y");
for (i = 1; i <= ylen; ++i)
printf("(%11f,%11f)\n", y[i - 1].re, y[i - 1].im);

END:
NAG_FREE(ap);
NAG_FREE(x);
NAG_FREE(y);

return exit_status;
}
```