-
Notifications
You must be signed in to change notification settings - Fork 0
/
1741A.go
83 lines (71 loc) · 1.07 KB
/
1741A.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
package main
import (
"bufio"
"fmt"
"os"
"strings"
)
var in, out = bufio.NewReader(os.Stdin), bufio.NewWriter(os.Stdout)
func solve() string {
var x, y string
fmt.Fscan(in, &x, &y)
val := map[rune]int{
'S': 1,
'M': 2,
'L': 3,
}
lx, ly := len(x), len(y)
xlast, ylast := rune(x[lx-1]), rune(y[ly-1])
if xlast != ylast {
if val[xlast] < val[ylast] {
return "<"
}
if val[xlast] == val[ylast] {
return "="
} else {
return ">"
}
}
xx := strings.Count(x, "X")
xy := strings.Count(y, "X")
if xx == xy {
return "="
}
if (xx < xy && xlast == 'L') || (xx > xy && xlast == 'S') {
return "<"
}
return ">"
}
func main() {
defer out.Flush()
var t int
for fmt.Fscanln(in, &t); t > 0; t-- {
fmt.Fprintln(out, solve())
}
}
// util functions
func max(x, y int) int {
if x > y {
return x
}
return y
}
func min(x, y int) int {
if x < y {
return x
}
return y
}
func abs(x int) int {
if x < 0 {
return -x
}
return x
}
func makeMatrix(n, m int) [][]int {
x := make([][]int, n)
for i := range x {
x[i] = make([]int, m)
}
return x
}