-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.go
67 lines (54 loc) · 1002 Bytes
/
main.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
// Copyright (c) 2021 Quirino Gervacio
package main
import (
"fmt"
"math/rand"
"sort"
"time"
)
func main() {
// system to use
sys := 6
// how many set to generate
set := 24
// any numbers to skip
skip := []int{}
for i := 1; i <= set; i++ {
var bet []int
// don't stop until I get set of sys
for {
// toto range
n := random(1, 49)
// check for skips
if exist(skip, n) {
// fmt.Printf("Skipping %d\n", n)
continue
}
// check if n is already generated
if exist(bet, n) {
// fmt.Printf("Already exist %d\n", n)
continue
}
bet = append(bet, n)
// fmt.Printf("Added %d\n", n)
// if set is full
if len(bet) == sys {
sort.Ints(bet)
fmt.Printf("Set#%d done. Got %v\n", i, bet)
break
}
}
}
}
func random(min, max int) int {
rand.Seed(time.Now().UnixNano())
return min + rand.Intn(max-min+1)
}
func exist(slice []int, n int) bool {
for _, i := range slice {
if i == n {
return true
}
}
return false
}