-
Notifications
You must be signed in to change notification settings - Fork 0
/
215a.go
69 lines (64 loc) · 1000 Bytes
/
215a.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
// 00
package main
import (
"bufio"
"fmt"
"os"
)
func write(f *bufio.Writer, a ...interface{}) {
f.Write([]byte(fmt.Sprint(a...)))
}
type Number interface {
int64 | float64 | int
}
func min[K Number](a K, b K) K {
if a < b {
return a
}
return b
}
func max[K Number](a K, b K) K {
if a > b {
return a
}
return b
}
func abs[K Number](a K) K {
if a < 0 {
return -a
}
return a
}
func main() {
var n, m int
reader := bufio.NewReader(os.Stdin)
f := bufio.NewWriter(os.Stdout)
defer f.Flush()
fmt.Fscan(reader, &n)
a := make([]int, n)
for i := 0; i < n; i++ {
fmt.Fscan(reader, &a[i])
}
fmt.Fscan(reader, &m)
b := make([]int, m)
for i := 0; i < m; i++ {
fmt.Fscan(reader, &b[i])
}
ans := 1
for i := 0; i < m; i++ {
for j := 0; j < n; j++ {
if b[i]%a[j] == 0 {
ans = max(ans, b[i]/a[j])
}
}
}
count := 0
for i := 0; i < m; i++ {
for j := 0; j < n; j++ {
if b[i]%a[j] == 0 && b[i]/a[j] == ans {
count++
}
}
}
write(f, count, "\n")
}