-
Notifications
You must be signed in to change notification settings - Fork 0
/
p37.go
70 lines (57 loc) · 1.02 KB
/
p37.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
package main
import (
"fmt"
"math"
"sort"
"strconv"
"time"
)
func IsPrime(prime []int, x int) bool {
bound := int(math.Sqrt(float64(x)))
if x%bound == 0 {
return false
}
for _, p := range prime {
if p >= bound {
return true
}
if x%p == 0 {
return false
}
}
return true
}
func main() {
start := time.Now()
prime, maxP := []int{2, 3, 5, 7, 11, 13}, 13
sum := 0
cnt := 0
for cnt < 11 {
maxP += 2
if IsPrime(prime, maxP) {
prime = append(prime, maxP)
str := strconv.Itoa(maxP)
isTuncatable := true
for i := 1; i < len(str); i++ {
curr, _ := strconv.Atoi(str[i:])
if prime[sort.SearchInts(prime, curr)] != curr {
isTuncatable = false
break
}
curr, _ = strconv.Atoi(str[:len(str)-i])
if prime[sort.SearchInts(prime, curr)] != curr {
isTuncatable = false
break
}
}
if isTuncatable {
fmt.Println("#", cnt, maxP)
cnt++
sum += maxP
}
}
}
fmt.Println(sum)
elapsed := time.Since(start)
fmt.Println("Elasped:", elapsed)
}