-
Notifications
You must be signed in to change notification settings - Fork 0
/
P1205_transformations.go
162 lines (147 loc) · 3.33 KB
/
P1205_transformations.go
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
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
package main
import "fmt"
var n int
// judge if a slice equals b slice
func equal(a [][]string, b [][]string) bool {
for i := 0; i < n; i++ {
for j := 0; j < n; j++ {
if a[i][j] != b[i][j] {
return false
}
}
}
return true
}
// judge the situation
func judge(a [][]string, b [][]string) int {
if equal(clockwise90(a), b) {
return 1
} else if equal(clockwise180(a), b) {
return 2
} else if equal(clockwise270(a), b) {
return 3
} else if equal(horizonal(a), b) {
return 4
} else if equal(combination90(a), b) || equal(combination180(a), b) || equal(combination270(a), b) {
return 5
} else if equal(a, b) {
return 6
} else {
return 7
}
}
// 1
func clockwise90(matrix [][]string) [][]string {
var temp = make([][]string, len(matrix))
for i := range matrix {
temp[i] = make([]string, len(matrix[i]))
// copy(temp[i], matrix[i])
}
for i := 0; i < n; i++ {
for j := 0; j < n; j++ {
temp[j][n-i-1] = matrix[i][j]
}
}
return temp
}
// 2
func clockwise180(matrix [][]string) [][]string {
var temp = make([][]string, len(matrix))
for i := range matrix {
temp[i] = make([]string, len(matrix[i]))
// copy(temp[i], matrix[i])
}
temp = clockwise90(matrix)
temp = clockwise90(temp)
return temp
}
// 3
func clockwise270(matrix [][]string) [][]string {
var temp = make([][]string, len(matrix))
for i := range matrix {
temp[i] = make([]string, len(matrix[i]))
// copy(temp[i], matrix[i])
}
temp = clockwise180(matrix)
temp = clockwise90(temp)
return temp
}
// 4
func horizonal(matrix [][]string) [][]string {
var temp = make([][]string, len(matrix))
for i := range matrix {
temp[i] = make([]string, len(matrix[i]))
// copy(temp[i], matrix[i])
}
for i := 0; i < n; i++ {
for j := 0; j < n; j++ {
temp[i][j] = matrix[i][n-j-1]
}
}
return temp
}
// 5.90
func combination90(matrix [][]string) [][]string {
var temp = make([][]string, len(matrix))
for i := range matrix {
temp[i] = make([]string, len(matrix[i]))
// copy(temp[i], matrix[i])
}
temp = horizonal(matrix)
temp = clockwise90(temp)
return temp
}
// 5.180
func combination180(matrix [][]string) [][]string {
var temp = make([][]string, len(matrix))
for i := range matrix {
temp[i] = make([]string, len(matrix[i]))
// copy(temp[i], matrix[i])
}
temp = horizonal(matrix)
temp = clockwise180(temp)
return temp
}
// 5.270
func combination270(matrix [][]string) [][]string {
var temp = make([][]string, len(matrix))
for i := range matrix {
temp[i] = make([]string, len(matrix[i]))
// copy(temp[i], matrix[i])
}
temp = horizonal(matrix)
temp = clockwise270(temp)
return temp
}
func main() {
// handle inputs
fmt.Scanln(&n)
var primeBlock = make([][]string, 0)
for i := 0; i < n; i++ {
var arr = make([]string, n)
primeBlock = append(primeBlock, arr)
}
var temp1 string
for i := 0; i < n; i++ {
fmt.Scanln(&temp1)
for j := 0; j < n; j++ {
primeBlock[i][j] = string(temp1[j])
}
}
var resBlock = make([][]string, 0)
for i := 0; i < n; i++ {
var ar = make([]string, n)
resBlock = append(resBlock, ar)
}
var temp2 string
for i := 0; i < n; i++ {
fmt.Scanln(&temp2)
for j := 0; j < n; j++ {
resBlock[i][j] = string(temp2[j])
}
}
// fmt.Printf("%T %v\n", primeBlock, primeBlock)
// fmt.Printf("%T %v\n", primeBlock[0][0], primeBlock[0][0])
result := judge(primeBlock, resBlock)
fmt.Printf("%d", result)
}