สี่เหลี่ยม พิศวง

//n[n*n+1]/2.
void BuildMagicSquare()
{
int order=5,loop;
int MagicMat[5][5];
int SqrOfOrder = order * order;
int nCount=0, mid=order/2;
for(loop=1; loop<=SqrOfOrder ; ++loop)
{
MagicMat[nCount--][mid++] = loop;
if (loop % order == 0)
{
nCount += 2;
--mid;
}
else
{
if (mid==order)
mid -= order;
else if (nCount<0)
nCount += order;
}
}
}