-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathp51.go
98 lines (82 loc) · 1.47 KB
/
p51.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
package main
import (
"fmt"
"math"
"strconv"
"time"
)
func IsPrime(prime []int64, x int64) bool {
bound := int64(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 Add(set map[string][]rune, str []rune, d rune, beg int) {
for i := beg; i < len(str); i++ {
if str[i] == d {
str[i] = rune('*')
set[string(str)] = append(set[string(str)], d)
Add(set, str, d, i+1)
str[i] = d
}
}
}
func main() {
start := time.Now()
limit := int64(100)
digits := []rune("0123456789")
prime, maxP := []int64{2, 3, 5}, int64(7)
done := false
for maxP < int64(10) {
if IsPrime(prime, maxP) {
prime = append(prime, maxP)
}
maxP += 2
}
for !done {
set := make(map[string][]rune)
for maxP < limit {
if IsPrime(prime, maxP) {
prime = append(prime, maxP)
currStr := []rune(strconv.FormatInt(maxP, 10))
for _, d := range digits {
cnt := 0
for _, td := range currStr {
if td == d {
cnt++
}
}
if cnt > 0 {
Add(set, currStr, d, 0)
}
}
}
maxP += 2
}
limit *= 10
for currStr, d := range set {
if len(d) == 8 {
tmpStr := []rune(currStr)
for i, c := range tmpStr {
if c == rune('*') {
tmpStr[i] = d[0]
}
}
fmt.Println(string(tmpStr))
done = true
break
}
}
}
elapsed := time.Since(start)
fmt.Println("Elasped:", elapsed)
}