-
Notifications
You must be signed in to change notification settings - Fork 0
/
BishopsAndRooks.kt
75 lines (66 loc) · 2.2 KB
/
BishopsAndRooks.kt
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
package complexity
fun main() {
val matrix = List(8) { readln().toCharArray().toList().subList(0, 8).toCharArray() }
for (i in matrix.indices) {
for (j in matrix[i].indices) {
if (matrix[i][j] == 'R') {
var y = i + 1
var x = j
while (y < 8 && (matrix[y][x] == '*' || matrix[y][x] == '+')) {
matrix[y][x] = '+'
y++
}
y = i - 1
x = j
while (y >= 0 && (matrix[y][x] == '*' || matrix[y][x] == '+')) {
matrix[y][x] = '+'
y--
}
y = i
x = j + 1
while (x < 8 && (matrix[y][x] == '*' || matrix[y][x] == '+')) {
matrix[y][x] = '+'
x++
}
y = i
x = j - 1
while (x >= 0 && (matrix[y][x] == '*' || matrix[y][x] == '+')) {
matrix[y][x] = '+'
x--
}
} else if (matrix[i][j] == 'B') {
var y = i + 1
var x = j + 1
while (y < 8 && x < 8 && (matrix[y][x] == '*' || matrix[y][x] == '+')) {
matrix[y][x] = '+'
x++
y++
}
y = i + 1
x = j - 1
while (y < 8 && x >= 0 && (matrix[y][x] == '*' || matrix[y][x] == '+')) {
matrix[y][x] = '+'
x--
y++
}
y = i - 1
x = j + 1
while (y >= 0 && x < 8 && (matrix[y][x] == '*' || matrix[y][x] == '+')) {
matrix[y][x] = '+'
x++
y--
}
y = i - 1
x = j - 1
while (y >= 0 && x >= 0 && (matrix[y][x] == '*' || matrix[y][x] == '+')) {
matrix[y][x] = '+'
x--
y--
}
}
}
}
var count = 0
matrix.forEach { count += it.count { ch -> ch == '*'} }
println(count)
}