/* PythagQuints.c */
/* (crude method)) discovering Pythagorean quadruples between 1 and N */

#include <stdio.h>

#define N 20

void main(void)
{
 int H,I,J,K,L,M,I2,J2,K2;

 for (I=1; I<N; I++)
  {
   I2 = I*I;
   for (J=I; J<N; J++)
    {
     J2 = J*J;
     for (K=J; K<N; K++)
      {
       K2 = K*K;
       for (L=K; L<=N; L++)
        {
         H = I2 + J2 + K2 + L*L;
         M=1; while (M*M<H)M++;
         if (L != I) if (M*M==H) printf("%d %d %d %d  %d,  ",I,J,K,L,M);
        }
      } /* end K */
    } /* end J */
    puts("\n");
  } /* end I */
 puts("");
 getchar(); 
}