/* nag_stat_prob_binomial (g01bjc) Example Program.
 *
 * Copyright 2024 Numerical Algorithms Group.
 *
 * Mark 30.2, 2024.
 *
 */

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

int main(void) {
  Integer exit_status = 0;
  Integer k, n;
  double plek, peqk, pgtk;
  double p;
  NagError fail;

  INIT_FAIL(fail);

  printf("nag_stat_prob_binomial (g01bjc) Example Program Results\n");
  /* Skip heading in data file */
  scanf("%*[^\n] ");

  printf("\n");
  printf("   n     p      k     plek      pgtk      peqk\n\n");
  while ((scanf("%" NAG_IFMT " %lf %" NAG_IFMT "%*[^\n]", &n, &p, &k)) != EOF)
  {
    /* nag_stat_prob_binomial (g01bjc).
     * Binomial distribution function
     */
    nag_stat_prob_binomial(n, p, k, &plek, &pgtk, &peqk, &fail);
    if (fail.code != NE_NOERROR) {
      printf("Error from nag_stat_prob_binomial (g01bjc)\n%s\n", fail.message);
      exit_status = 1;
      goto END;
    }
    printf("%5" NAG_IFMT "%8.3f%5" NAG_IFMT "%10.5f%10.5f%10.5f\n", n, p, k,
           plek, pgtk, peqk);
  }

END:
  return exit_status;
}