Prime triangle: Difference between revisions
→{{header|Go}}: Updated in line with Phix example of which this is a translation.
(→{{header|Wren}}: Updated in line with Phix example of which it's a translation.) |
(→{{header|Go}}: Updated in line with Phix example of which this is a translation.) |
||
Line 397:
=={{header|Go}}==
Takes about 0.64 seconds.
{{trans|Phix}}
<lang go>package main
Line 403 ⟶ 404:
var canFollow [][]bool
var arrang []int
var
var pmap = make(map[int]bool)
Line 419:
if n-done <= 1 {
if canFollow[ad-1][n-1] {
if
for _, e := range arrang {
fmt.Printf("%2d ", e)
}
fmt.Println()
}
res++
Line 429 ⟶ 430:
} else {
done++
for i := done - 1; i <= n-2; i +
if
arrang[i], arrang[done-1] =
res = ptrs(res, n, done)
▲ avail[i] = true
}
}
Line 453 ⟶ 451:
}
}
for i := 0;
}
arrang = make([]int, n)▼
▲ arrang[0] = 1
return ptrs(0, n, 1)
}
func main() {
for i := 2; i <= 20; i++ {
counts[i-2] = primeTriangle(i)
}
fmt.Println()
}
fmt.Println()
| |||