blob: 819dc9c597ea6ea2705a7dc9e86137d7afc5b157 (
plain) (
blame)
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
|
#include <stdlib.h>
int N;
int *t;
int
chk(int x, int y)
{
int i;
int r;
for (r=i=0; i<8; i++) {
r = r + t[x + 8*i];
r = r + t[i + 8*y];
if (x+i < 8 & y+i < 8)
r = r + t[x+i + 8*(y+i)];
if (x+i < 8 & y-i >= 0)
r = r + t[x+i + 8*(y-i)];
if (x-i >= 0 & y+i < 8)
r = r + t[x-i + 8*(y+i)];
if (x-i >= 0 & y-i >= 0)
r = r + t[x-i + 8*(y-i)];
}
return r;
}
int
go(int n, int x, int y)
{
if (n == 8) {
N++;
return 0;
}
for (; y<8; y++) {
for (; x<8; x++)
if (chk(x, y) == 0) {
t[x + 8*y]++;
go(n+1, x, y);
t[x + 8*y]--;
}
x = 0;
}
return 0;
}
int
main()
{
t = calloc(64, sizeof(int));
go(0, 0, 0);
if(N != 92)
return 1;
return 0;
}
|