-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmagic.c
129 lines (129 loc) · 2.56 KB
/
magic.c
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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
#include<stdio.h>
void main()
{
int a[20][20] = { 0 };
int i , j, n, k,l,m,t;
printf("input 1~16\n");
scanf_s("%d", &n);
if (n % 2 == 1)
{
for (i = 0, j = n / 2, k = 1; k <= n * n; i--, j++, k++)
{
if ((i == -1 && j == n) || (i >= 0 && a[i][j] != 0))
{
i = i + 2;
j = j - 1;
}
if (i == -1)
i = n - 1;
if (j == n)
j = 0;
a[i][j] = k;
}
}
else if (n % 4 == 0)
{
for (k = 1, i = 0; i < n; i++)
{
for (j = 0; j < n; j++)
{
a[i][j] = k;
k++;
for (l = 1 - n; -n < l&&l < n; l++)
{
if (i == j || (l % 4 == 0 && i + j == n - 1 - l) || (i - j) % 4 == 0)
a[i][j] = 0;
}
}
}
for (k = 1, i = n - 1; i >= 0; i--)
{
for (j = n - 1; j >= 0; j--)
{
if (a[i][j] != 0)
{
k++;
continue;
}
a[i][j] = k;
k++;
}
}
}
else if (n % 2 == 0 && n % 4 != 0)
{
m = (n - 2) / 4;
for (i = 0, j = n / 4, k = 1; k <= n * n / 4; i--, j++, k++)
{
if ((i == -1 && j == n / 2) || (i >= 0 && a[i][j] != 0))
{
i = i + 2;
j = j - 1;
}
if (i == -1)
i = n / 2 - 1;
if (j == n / 2)
j = 0;
a[i][j] = k;
}
for (i = n / 2, j = n / 2 + n / 4; k <= n * n / 2; i--, j++, k++)
{
if ((i == n / 2 - 1 && j == n) || (i >= n / 2 && a[i][j] != 0))
{
i = i + 2;
j = j - 1;
}
if (i == n / 2 - 1)
i = n - 1;
if (j == n)
j = n / 2;
a[i][j] = k;
}
for (i = 0, j = n / 2 + n / 4; k <= n * n / 2 + n*n / 4; i--, j++, k++)
{
if ((i == -1 && j == n) || (i >= 0 && a[i][j] != 0))
{
i = i + 2;
j = j - 1;
}
if (i == -1)
i = n / 2 - 1;
if (j == n)
j = n / 2;
a[i][j] = k;
}
for (i = n / 2, j = n / 4; k <= n * n; i--, j++, k++)
{
if ((i == n / 2 - 1 && j == n / 2) || (i >= n / 2 && j <= n / 2 - 1 && a[i][j] != 0))
{
i = i + 2;
j = j - 1;
}
if (i == n / 2 - 1)
i = n - 1;
if (j == n / 2)
j = 0;
a[i][j] = k;
}
for (i = 0; i <= 19; i++)
for (j = 0; j <= 19; j++)
if (i<n / 2 && (j > n / 2 + m + 1 || (i == m&&j == m) || (j < m&&!(j == 0 && i == m))))
{
t = a[i][j];
a[i][j] = a[i + n / 2][j];
a[i + n / 2][j] = t;
}
}
for (i = 0; i <= 19; i++)
{
printf("\n");
for (j = 0; j <= 19; j++)
if (a[i][j] != 0)
{
printf("%-4d", a[i][j]);
}
printf("\n");
if (a[i][0] == 0)break;
}
system("pause");
}