Algorithms/MagicSquareOddOrder.cpp at main · a-pt/Algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
#include <iostream>

using namespace std;


int square[15][15];

void magicSquareOdd(int n)
{
    int i,j;
    i=n/2;
    j=n-1;
    square[i][j]=1;
    int entry=1;
    int flag=0;
    while(entry<n*n)
    {
        if(flag==0)
        {
            i=i-1;
            j=j+1;
        }
        else
        {
            i=i+1;
            j=j-2;
        }
        if((i==-1)&&(j==n))
        {
            j=n-2;
            i=0;
        }
        else if(i==-1)
            i=n-1;
        else if(j==n)
            j=0;

        if(square[i][j]==0)
        {
            entry++;
            square[i][j]=entry;
            flag=0;
        }
        else
        {
            flag=1;
        }
    }

    for(int i=0;i<n;i++)
    {
        for(int j=0;j<n;j++)
        {
            cout<<square[i][j]<<" ";
        }
        cout<<endl;
    }
}


int main()
{
    int order;
    cin>>order;
    magicSquareOdd(order);
    return 0;
}