/* nag_fft_multiple_complex(c06frc) Example Program * * Copyright 1990 Numerical Algorithms Group. * * Mark 1, 1990. * * Mark 3 revised, 1994. */ #include #include #include #include #define MMAX 5 #define NMAX 20 int main(void) { double trig[2*NMAX]; Integer i, j, m, n; double x[MMAX*NMAX], y[MMAX*NMAX]; /* Skip heading in data file */ Vscanf("%*[^\n]"); Vprintf("c06frc Example Program Results\n"); while (scanf("%ld%ld", &m, &n)!=EOF) if (m<=MMAX && n<=NMAX) { Vprintf("\n\nm = %2ld n = %2ld\n", m, n); for (j = 0; j