-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1692D.go
90 lines (75 loc) · 1.13 KB
/
1692D.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
package main
import (
"bufio"
"fmt"
"os"
"strconv"
"strings"
)
var in, out = bufio.NewReader(os.Stdin), bufio.NewWriter(os.Stdout)
func solve() string {
var time string
var h, m, ii, hi, mi int
fmt.Fscan(in, &time)
fmt.Fscan(in, &ii)
var tmp int64
tmp, _ = strconv.ParseInt(strings.Split(time, ":")[0], 10, 32)
h = int(tmp)
tmp, _ = strconv.ParseInt(strings.Split(time, ":")[1], 10, 32)
m = int(tmp)
hi = ii / 60
mi = ii % 60
var res int
var sh, sm = h, m
for true {
m += mi
if m > 59 {
h++
m %= 60
}
h += hi
if h > 23 {
h %= 24
}
if h/10 == m%10 && h%10 == m/10 {
res++
}
if sh == h && sm == m {
break
}
}
return strconv.FormatInt(int64(res), 10)
}
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
}