Math FPCore C Fortran Java Python Julia MATLAB Wolfram TeX \[x \cdot y + \left(x - 1\right) \cdot z
\]
↓
\[x \cdot \left(y + z\right) - z
\]
(FPCore (x y z) :precision binary64 (+ (* x y) (* (- x 1.0) z))) ↓
(FPCore (x y z) :precision binary64 (- (* x (+ y z)) z)) double code(double x, double y, double z) {
return (x * y) + ((x - 1.0) * z);
}
↓
double code(double x, double y, double z) {
return (x * (y + z)) - z;
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (x * y) + ((x - 1.0d0) * z)
end function
↓
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (x * (y + z)) - z
end function
public static double code(double x, double y, double z) {
return (x * y) + ((x - 1.0) * z);
}
↓
public static double code(double x, double y, double z) {
return (x * (y + z)) - z;
}
def code(x, y, z):
return (x * y) + ((x - 1.0) * z)
↓
def code(x, y, z):
return (x * (y + z)) - z
function code(x, y, z)
return Float64(Float64(x * y) + Float64(Float64(x - 1.0) * z))
end
↓
function code(x, y, z)
return Float64(Float64(x * Float64(y + z)) - z)
end
function tmp = code(x, y, z)
tmp = (x * y) + ((x - 1.0) * z);
end
↓
function tmp = code(x, y, z)
tmp = (x * (y + z)) - z;
end
code[x_, y_, z_] := N[(N[(x * y), $MachinePrecision] + N[(N[(x - 1.0), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision]
↓
code[x_, y_, z_] := N[(N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision] - z), $MachinePrecision]
x \cdot y + \left(x - 1\right) \cdot z
↓
x \cdot \left(y + z\right) - z
Alternatives Alternative 1 Accuracy 62.4% Cost 588
\[\begin{array}{l}
\mathbf{if}\;x \leq -6.8 \cdot 10^{+149}:\\
\;\;\;\;x \cdot z\\
\mathbf{elif}\;x \leq -1.95 \cdot 10^{-91}:\\
\;\;\;\;x \cdot y\\
\mathbf{elif}\;x \leq 1.7 \cdot 10^{-28}:\\
\;\;\;\;-z\\
\mathbf{else}:\\
\;\;\;\;x \cdot y\\
\end{array}
\]
Alternative 2 Accuracy 80.2% Cost 585
\[\begin{array}{l}
\mathbf{if}\;x \leq -1.25 \cdot 10^{-92} \lor \neg \left(x \leq 6 \cdot 10^{-28}\right):\\
\;\;\;\;x \cdot \left(y + z\right)\\
\mathbf{else}:\\
\;\;\;\;-z\\
\end{array}
\]
Alternative 3 Accuracy 98.2% Cost 585
\[\begin{array}{l}
\mathbf{if}\;x \leq -250000 \lor \neg \left(x \leq 4.2 \cdot 10^{-15}\right):\\
\;\;\;\;x \cdot \left(y + z\right)\\
\mathbf{else}:\\
\;\;\;\;x \cdot y - z\\
\end{array}
\]
Alternative 4 Accuracy 98.2% Cost 584
\[\begin{array}{l}
\mathbf{if}\;x \leq -250000:\\
\;\;\;\;x \cdot z + x \cdot y\\
\mathbf{elif}\;x \leq 4.2 \cdot 10^{-15}:\\
\;\;\;\;x \cdot y - z\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(y + z\right)\\
\end{array}
\]
Alternative 5 Accuracy 62.3% Cost 456
\[\begin{array}{l}
\mathbf{if}\;x \leq -1.45 \cdot 10^{-92}:\\
\;\;\;\;x \cdot y\\
\mathbf{elif}\;x \leq 5.8 \cdot 10^{-29}:\\
\;\;\;\;-z\\
\mathbf{else}:\\
\;\;\;\;x \cdot y\\
\end{array}
\]
Alternative 6 Accuracy 45.0% Cost 128
\[-z
\]