//about 1375 ticks--not bad considering overload.

#pragma off (check_stack);  //This can save a few ticks

#include <iostream.h>
#include <stdlib.h>
#include <math.h>
#include <time.h>

int precision=128;
const int zmaxsize=51;
int cmaxsize=0;
int qqq2;

#include "genprec.h"
//#include "genpnoas.sem"
realmp m[zmaxsize+3][zmaxsize+3],r[zmaxsize+3],u[zmaxsize+3];

main()
  {int i,j,k,n;
   clock_t start_time, end_time;   //declaration statement for times
   start_time=clock();             //set start time
   n=50;
   for (i=1;i<n+1;i++)
     {r[i]=i;                      //wconinttomp(i);
      for (j=1;j<n+1;j++)
        {m[i][j]=i*j;              //wconinttomp(i*j);
         if (i==j) m[i][j]=m[i][j] + 1;
        }
     }
   for (k=2;k<n+1;k++)
     {for (i=k;i<n+1;i++)
        { r[i]=r[i] - m[i][k-1]*r[k-1]/m[k-1][k-1];
         for (j=k;j<n+1;j++)
           {m[i][j]=m[i][j]-m[i][k-1]*m[k-1][j]/m[k-1][k-1];}
        }
     }
   u[n]=r[n]/m[n][n];
   for (i=2;i<n+1;i++)
     {u[n-i+1]=r[n-i+1];
      for (j=1;j<i;j++)
        {u[n-i+1]=u[n-i+1]-m[n-i+1][n-j+1]*u[n-j+1];}
      u[n-i+1]=u[n-i+1]/m[n-i+1][n-i+1];
     }
  end_time=clock();
  cout<<"clock ticks"<<'\t'<<end_time - start_time<<'\n';
  cout<<"ticks/second"<<'\t'<<CLOCKS_PER_SEC<<'\n';
  cout<<"execution time"<<'\t'<<(end_time - start_time)/CLOCKS_PER_SEC<<'\t'<<"seconds"<<'\n';
  zmessage="timing data";
  zbreak();
   for (i=1;i<n+1;i++)
     {printmp(u[i]);
      cin>>qqq2;
     }
  }

/*
'modified to agree with genlind.h

90 defdbl x,m,r
95 defint i,j,k,n
100 dim x(100)
110 dim r(100)
120 dim m(60,60)
130 n=50
140 for i=1 to n
150 r(i)=cdbl(i)
160 for j=1 to n
170 m(i,j)=cdbl(i*j)
172 if i=j then m(i,j)=m(i,j)+1#
180 next j
190 next i
200 for k=2 to n
210 for i=k to n
220 r(i)=r(i)-m(k-1,i)*r(k-1)/m(k-1,k-1)
230 for j=k to n
240 m(i,j)=m(i,j)-m(i,k-1)*m(k-1,j)/m(k-1,k-1)
250 next j
260 next i
270 next k
280 x(n)=r(n)/m(n,n)
divcount=divcount+1
290 for i=2 to n
300 x(n-i+1)=r(n-i+1)
310 for j=1 to i-1
320 x(n-i+1)=x(n-i+1)-m(n-i+1,n-j+1)*x(n-j+1)
330 next j
340 x(n-i+1)=x(n-i+1)/m(n-i+1,n-i+1)
350 next i
360 for i=1 to n
370 print x(i)
    input qqq
380 next i
390 stop
400 end

*/