Repeated Outcome Tree Count outcomes per stage Solver

            from math import *

def repeated_outcome_tree_count_solve_a(c, b) -> float:
    return pow(c, (1.0 / b))

assert abs(repeated_outcome_tree_count_solve_a(1296, 4) - 6) < 1e-6 * max(1.0, abs(6))
          

            #include <assert.h>
#include <math.h>

double repeated_outcome_tree_count_solve_a(double c, double b) {
    return pow(c, (1.0 / b));
}

int main(void) {
    const double expected = 6;
    const double actual = repeated_outcome_tree_count_solve_a(1296, 4);
    assert(fabs(actual - expected) < 1e-6 * fmax(1.0, fabs(expected)));
}
          

            #include <cassert>
#include <cmath>
#include <numbers>

double repeated_outcome_tree_count_solve_a(double c, double b) {
    return std::pow(c, (1.0 / b));
}

int main() {
    constexpr double expected = 6;
    const double actual = repeated_outcome_tree_count_solve_a(1296, 4);
    assert(std::fabs(actual - expected) < 1e-6 * std::fmax(1.0, std::fabs(expected)));
}
          

x86-64 NASM · System V ABI · Linux · SSE2 with libm where required

            ; double repeated_outcome_tree_count_solve_a(double c, double b)
; Linux x86-64 NASM · System V ABI · first eight doubles in xmm0–xmm7
extern pow
global repeated_outcome_tree_count_solve_a
section .text

repeated_outcome_tree_count_solve_a:
    push rbp
    mov rbp, rsp
    sub rsp, 48
    movsd [rbp-8], xmm0
    movsd [rbp-16], xmm1
    mov rax, 0x3ff0000000000000
    movq xmm0, rax
    movsd [rbp-40], xmm0
    movsd xmm0, [rbp-40]
    divsd xmm0, [rbp-16]
    movsd [rbp-32], xmm0
    movsd xmm0, [rbp-8]
    movsd xmm1, [rbp-32]
    call pow wrt ..plt
    movsd [rbp-24], xmm0
    movsd xmm0, [rbp-24]
    leave
    ret
          

            function result = repeated_outcome_tree_count_solve_a(c, b)
    result = (c ^ (1.0 / b));
end
          

            ClearAll[mwCalculate];
mwCalculate[c_, b_] := (c ^ (1.0 / b));