Anonymous user
Paraffins: Difference between revisions
Scala contribution added.
m (→{{header|REXX}}: added a programming note to the REXX section header.) |
(Scala contribution added.) |
||
Line 3,014:
</pre>
=={{header|Scala}}==
<lang Scala>object Paraffins extends App {
val (nMax, nBranches) = (250, 4)
val rooted = (0 to nMax).map(i => if (i < 2) BigInt(1) else BigInt(0)).toArray
val (unrooted, c) = (rooted.clone(), new Array[BigInt](nBranches))
for (n <- 1 to nMax) {
def tree(br: Int, n: Int, l: Int, inSum: Int, cnt: BigInt): Unit = {
var sum = inSum
for (b <- br + 1 to nBranches) {
sum += n
if (sum > nMax || (l * 2 >= sum && b >= nBranches)) return
if (b == br + 1) c(br) = rooted(n) * cnt
else {
c(br) = c(br) * (rooted(n) + BigInt(b - br - 1))
c(br) = c(br) / BigInt(b - br)
}
if (l * 2 < sum) unrooted(sum) = unrooted(sum) + c(br)
if (b < nBranches) rooted(sum) = rooted(sum) + c(br)
for (m <- n - 1 to 1 by -1) tree(b, m, l, sum, c(br))
}
}
def bicenter(s: Int): Unit = if ((s & 1) == 0) {
val halves = rooted(s / 2)
unrooted(s) = unrooted(s) + ((halves + BigInt(1)) * halves >> 1)
}
tree(0, n, n, 1, BigInt(1))
bicenter(n)
println(f"$n%3d: ${unrooted(n)}%s")
}
}</lang>
{{Out}}See it in running in your browser by [https://scalafiddle.io/sf/JjR1R6k/1 ScalaFiddle (JavaScript)] or by [https://scastie.scala-lang.org/QEDTegb7TnWb0RktzKI7aQ Scastie (JVM)].
=={{header|Seed7}}==
<lang seed7>$ include "seed7_05.s7i";
| |||