-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.go
45 lines (37 loc) · 978 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
package main
import "fmt"
func recurse(taps []*tap, orgs []*org) (mapping map[tapID][]orgID) {
if len(taps) == 0 || len(orgs) == 0 {
return make(map[tapID][]orgID, 0)
}
o := orgs[0]
t := taps[0]
fmt.Printf("Tap %v still needs %v investments\n", t.id, t.price)
if t.price > o.budget {
fmt.Printf("Org %v invests tap %v\n", o.id, o.budget)
t.price -= o.budget
mapping = recurse(taps, orgs[1:])
} else {
fmt.Printf("Org %v invests tap %v\n", o.id, t.price)
o.budget -= t.price
mapping = recurse(taps[1:], orgs)
}
if _, ok := mapping[t.id]; !ok {
mapping[t.id] = make([]orgID, 0)
}
mapping[t.id] = append(mapping[t.id], o.id)
return mapping
}
func main() {
taps := createRandomTaps(6)
orgs := createRandomOrgs(4)
mapping := recurse(taps, orgs)
// Print mapping
for t, orgIDs := range mapping {
fmt.Printf("\nTap: %v\n", t.String())
fmt.Printf("Organizations:\n")
for _, o := range orgIDs {
fmt.Printf("- %v\n", o.String())
}
}
}