C / C++ / MFC

#include<stdio.h>
#define abs(x) ((x<0)?(-(x)):(x))
#define epsilon .000000000001
#define size 5
double multiply(a,m,product)
double a[size][size],product [size][size];
int *m;
{
     int test=0;
     int count,i,j,k,l;
     double olda[size][size],diff;
     for(i=0;i<*m;i++)
     for(j=0;j(* m;j++)
          olda[i][j]=a[i][j];
     for(count=1;count<=1000;count++)
     {
          for(i=0;i<*m;i++)
	  for(j=0;j<*m;j++)
	       product[i][j]=0;
	  for(i=0;i<*m;i++)
	  for(j=0;j<*m;j++)
	  for(k=0;k<*m;k++)
	       product[i][j]=product[i][j]+a[i][k]*olda[k][j];
	  for(i=0;i<*m;i++)
	  for(j=0;j<*m;j++)
	  {
	       diff=abs(product[i][j]-olda[i][j]);
	       if(diff>epsilon)
	       {
	            test=1;
		    for(k=0;k<*m;k++)
		    for(l=0;l<*m;l++)
	                 olda[k][l]=product[k][l];
	       }
	       break;
	   if(test<1)
	   {
	        printf("\nThe numberof iterations is:");
		printf("\n");
		printf("\n  %d",count);
		break;
           }
      test=0;
      }
      return(0);
}
main()
{
     static double a[size][size]={{0.1,1.0,0.0,0.0,0.0},
                                  {0.0,0.0,0.3,0.7,0.0},
				  {0.0,0.0,0.0,0.2,0.8},
				  {0.0,0.0,0.1,0.0,0.9},
				  {1.0,0.0,0.0,0.0,0.0}};
     double product[size][size],pi[size],diff;
     int test;
     int m=size;
     int i j;
     multiply(a,&m,product);
     printf("\n");
     printf((" \nThe product is:");
     printf("\n");
     for(i=0;i<m;i<m;i++)
     {
          printf("\n");
	  for(j=0;j<m;j++)
	       printf(" %15.12f", product[i][j]);
     }
printf("\n");
printf("n");
return(0);
}