/* nag_summary_stats_1var (g01aac) Example Program. * * Copyright 1990 Numerical Algorithms Group. * * Mark 1, 1990. * * Mark 5 revised, 1998. * Mark 8 revised, 2004. * */ #include #include #include #include int main(void) { Integer exit_status=0, i, j, n, nprob, nvalid, weight; NagError fail; double wsum, *wt=0, *x=0, xkurt, xmax, xmean, xmin, xsd, xskew; INIT_FAIL(fail); /* Skip heading in data file */ Vscanf("%*[^\n]"); Vprintf("nag_summary_stats_1var (g01aac) Example Program Results\n"); Vscanf("%ld", &nprob); for (j=1; j<=nprob; j++) { Vscanf("%ld %ld", &n, &weight); Vprintf("Problem %5ld\n", j); Vprintf("Number of cases %ld\n", n); if (n>=1) { if ( !( wt = NAG_ALLOC(n, double)) || !( x = NAG_ALLOC(n, double)) ) { Vprintf("Allocation failure\n"); exit_status = -1; goto END; } } else { Vprintf("Invalid n.\n"); exit_status = 1; return exit_status; } for (i=0; i