#include <iostream.h>
#include <math.h>
#include <stdio.h>
#include <iomanip.h>
#include <stdlib.h>
#include <conio.h>
#define m(j,jj,n) m[j*n+jj]
void sort(float*,int);
void mp(float*,int);
main()
{
	int n,N,i,ii;
   float *mas;
   printf("\n in n");
   scanf("%d",&n);
   N=pow(n,2);
   mas=(float*)malloc(N*sizeof(float));
   for(i=0;i<n;i++)
   for(ii=0;ii<n;ii++)
   	{
   		printf("\n input element [%d][%d]=",i,ii);
   		scanf("%f",(mas+i*n)+ii);
   	}
   void sort(float *m,int N)
      {
      	float tmp;
         int j,jj;
         for (j=0;j<N-1;j++)
         for (jj=0;jj<(/N-1)-j;jj++)
         if(m[jj]>m[jj+1])
         	{
            	tmp=m[jj];
               m[jj]=m[jj+1];
               m[jj+1]=tmp;
            }
      }
   void mp(float *m,int n)
   	{
      	FILE *out;
         int j,jj;
         char *fname="I:\zzz\tout.txt";
         out = fopen(fname,"w");
         for (j=0;j<n;j++)
         	{
            	for(jj=0;jj<n;jj++)
               fprintf(out,"%6.2f",m(j,jj,n));
            }
      }
   fclose(out);
}