(+84) 236.3827111 ex. 402

Hàm tạo ma phương


void MAPHUONG(int a[10][10],int&n)
{ do{printf("Nhap n = ");scanf("%d",&n);}while(n%2==0);
int i=n/2,j=n/2+1;
for(int k=1;k<=n*n;k++)
{ a[i][j]=k;
if((i==0)&&(k%n)!=0)
{ i=n-1;
j++;
}
else
if((j==n-1)&&(k%n!=0))
{ i--;
j=0;
}
else
if(k%n==0)
{ if(j==n-2)
j=0;
else
if(j==n-1)
j=1;
else j=j+2;
}
else
{ i--;
j++;
}
}
}