Equal Circles Total Circumference equal-circle count Solver

            from math import *

def equal_circles_total_circumference_solve_b(c, a) -> float:
    return (c / (pi * a))

assert abs(equal_circles_total_circumference_solve_b(150.79644737231007, 8) - 6) < 1e-6 * max(1.0, abs(6))
          

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

double equal_circles_total_circumference_solve_b(double c, double a) {
    return (c / (3.141592653589793 * a));
}

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

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

double equal_circles_total_circumference_solve_b(double c, double a) {
    return (c / (std::numbers::pi * a));
}

int main() {
    constexpr double expected = 6;
    const double actual = equal_circles_total_circumference_solve_b(150.79644737231007, 8);
    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 equal_circles_total_circumference_solve_b(double c, double a)
; Linux x86-64 NASM · System V ABI · first eight doubles in xmm0–xmm7
global equal_circles_total_circumference_solve_b
section .text

equal_circles_total_circumference_solve_b:
    push rbp
    mov rbp, rsp
    sub rsp, 48
    movsd [rbp-8], xmm0
    movsd [rbp-16], xmm1
    mov rax, 0x400921fb54442d18
    movq xmm0, rax
    movsd [rbp-40], xmm0
    movsd xmm0, [rbp-40]
    mulsd xmm0, [rbp-16]
    movsd [rbp-32], xmm0
    movsd xmm0, [rbp-8]
    divsd xmm0, [rbp-32]
    movsd [rbp-24], xmm0
    movsd xmm0, [rbp-24]
    leave
    ret
          

            function result = equal_circles_total_circumference_solve_b(c, a)
    result = (c / (pi * a));
end
          

            ClearAll[mwCalculate];
mwCalculate[c_, a_] := (c / (Pi * a));