/* nag_stat_prob_chisq_vector (g01scc) Example Program.
 *
 * Copyright 2023 Numerical Algorithms Group.
 *
 * Mark 29.1, 2023.
 */
#include <nag.h>
#include <stdio.h>

int main(void) {
  /* Integer scalar and array declarations */
  Integer ltail, lx, ldf, i, lout;
  Integer *ivalid = 0;
  Integer exit_status = 0;

  /* NAG structures */
  NagError fail;
  Nag_TailProbability *tail = 0;

  /* Double scalar and array declarations */
  double *x = 0, *df = 0, *p = 0;

  /* Character scalar and array declarations */
  char ctail[40];

  /* Initialize the error structure to print out any error messages */
  INIT_FAIL(fail);

  printf("nag_stat_prob_chisq_vector (g01scc) Example Program Results\n\n");

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

  /* Read in the input vectors */
  scanf("%" NAG_IFMT "%*[^\n] ", &ltail);
  if (!(tail = NAG_ALLOC(ltail, Nag_TailProbability))) {
    printf("Allocation failure\n");
    exit_status = -1;
    goto END;
  }
  for (i = 0; i < ltail; i++) {
    scanf("%39s", ctail);
    tail[i] = (Nag_TailProbability)nag_enum_name_to_value(ctail);
  }
  scanf("%*[^\n] ");
  scanf("%" NAG_IFMT "%*[^\n] ", &lx);
  if (!(x = NAG_ALLOC(lx, double))) {
    printf("Allocation failure\n");
    exit_status = -1;
    goto END;
  }
  for (i = 0; i < lx; i++)
    scanf("%lf", &x[i]);
  scanf("%*[^\n] ");
  scanf("%" NAG_IFMT "%*[^\n] ", &ldf);
  if (!(df = NAG_ALLOC(ldf, double))) {
    printf("Allocation failure\n");
    exit_status = -1;
    goto END;
  }
  for (i = 0; i < ldf; i++)
    scanf("%lf", &df[i]);
  scanf("%*[^\n] ");

  /* Allocate memory for output */
  lout = MAX(ltail, MAX(lx, ldf));
  if (!(p = NAG_ALLOC(lout, double)) || !(ivalid = NAG_ALLOC(lout, Integer))) {
    printf("Allocation failure\n");
    exit_status = -1;
    goto END;
  }

  /* Calculate probability */
  nag_stat_prob_chisq_vector(ltail, tail, lx, x, ldf, df, p, ivalid, &fail);
  if (fail.code != NE_NOERROR) {
    printf("Error from nag_stat_prob_chisq_vector (g01scc).\n%s\n",
           fail.message);
    exit_status = 1;
    if (fail.code != NW_IVALID)
      goto END;
  }

  /* Display title */
  printf("        tail           x         df        p     ivalid\n");
  printf(" --------------------------------------------------------\n");

  /* Display results */
  for (i = 0; i < lout; i++)
    printf(" %15s    %6.3f    %6.1f    %6.4f    %3" NAG_IFMT "\n",
           nag_enum_value_to_name(tail[i % ltail]), x[i % lx], df[i % ldf],
           p[i], ivalid[i]);

END:
  NAG_FREE(tail);
  NAG_FREE(x);
  NAG_FREE(df);
  NAG_FREE(p);
  NAG_FREE(ivalid);

  return (exit_status);
}