Math FPCore C Fortran Java Python Julia MATLAB Wolfram TeX \[\frac{x + \frac{y \cdot z - x}{t \cdot z - x}}{x + 1}
\]
↓
\[\begin{array}{l}
\mathbf{if}\;z \leq -2.05 \cdot 10^{+178} \lor \neg \left(z \leq 4.25 \cdot 10^{+130}\right):\\
\;\;\;\;\frac{\frac{y}{t} + x}{x + 1}\\
\mathbf{else}:\\
\;\;\;\;\frac{x + \frac{z \cdot y - x}{z \cdot t - x}}{x + 1}\\
\end{array}
\]
(FPCore (x y z t)
:precision binary64
(/ (+ x (/ (- (* y z) x) (- (* t z) x))) (+ x 1.0))) ↓
(FPCore (x y z t)
:precision binary64
(if (or (<= z -2.05e+178) (not (<= z 4.25e+130)))
(/ (+ (/ y t) x) (+ x 1.0))
(/ (+ x (/ (- (* z y) x) (- (* z t) x))) (+ x 1.0)))) double code(double x, double y, double z, double t) {
return (x + (((y * z) - x) / ((t * z) - x))) / (x + 1.0);
}
↓
double code(double x, double y, double z, double t) {
double tmp;
if ((z <= -2.05e+178) || !(z <= 4.25e+130)) {
tmp = ((y / t) + x) / (x + 1.0);
} else {
tmp = (x + (((z * y) - x) / ((z * t) - x))) / (x + 1.0);
}
return tmp;
}
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
code = (x + (((y * z) - x) / ((t * z) - x))) / (x + 1.0d0)
end function
↓
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8) :: tmp
if ((z <= (-2.05d+178)) .or. (.not. (z <= 4.25d+130))) then
tmp = ((y / t) + x) / (x + 1.0d0)
else
tmp = (x + (((z * y) - x) / ((z * t) - x))) / (x + 1.0d0)
end if
code = tmp
end function
public static double code(double x, double y, double z, double t) {
return (x + (((y * z) - x) / ((t * z) - x))) / (x + 1.0);
}
↓
public static double code(double x, double y, double z, double t) {
double tmp;
if ((z <= -2.05e+178) || !(z <= 4.25e+130)) {
tmp = ((y / t) + x) / (x + 1.0);
} else {
tmp = (x + (((z * y) - x) / ((z * t) - x))) / (x + 1.0);
}
return tmp;
}
def code(x, y, z, t):
return (x + (((y * z) - x) / ((t * z) - x))) / (x + 1.0)
↓
def code(x, y, z, t):
tmp = 0
if (z <= -2.05e+178) or not (z <= 4.25e+130):
tmp = ((y / t) + x) / (x + 1.0)
else:
tmp = (x + (((z * y) - x) / ((z * t) - x))) / (x + 1.0)
return tmp
function code(x, y, z, t)
return Float64(Float64(x + Float64(Float64(Float64(y * z) - x) / Float64(Float64(t * z) - x))) / Float64(x + 1.0))
end
↓
function code(x, y, z, t)
tmp = 0.0
if ((z <= -2.05e+178) || !(z <= 4.25e+130))
tmp = Float64(Float64(Float64(y / t) + x) / Float64(x + 1.0));
else
tmp = Float64(Float64(x + Float64(Float64(Float64(z * y) - x) / Float64(Float64(z * t) - x))) / Float64(x + 1.0));
end
return tmp
end
function tmp = code(x, y, z, t)
tmp = (x + (((y * z) - x) / ((t * z) - x))) / (x + 1.0);
end
↓
function tmp_2 = code(x, y, z, t)
tmp = 0.0;
if ((z <= -2.05e+178) || ~((z <= 4.25e+130)))
tmp = ((y / t) + x) / (x + 1.0);
else
tmp = (x + (((z * y) - x) / ((z * t) - x))) / (x + 1.0);
end
tmp_2 = tmp;
end
code[x_, y_, z_, t_] := N[(N[(x + N[(N[(N[(y * z), $MachinePrecision] - x), $MachinePrecision] / N[(N[(t * z), $MachinePrecision] - x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]
↓
code[x_, y_, z_, t_] := If[Or[LessEqual[z, -2.05e+178], N[Not[LessEqual[z, 4.25e+130]], $MachinePrecision]], N[(N[(N[(y / t), $MachinePrecision] + x), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[(x + N[(N[(N[(z * y), $MachinePrecision] - x), $MachinePrecision] / N[(N[(z * t), $MachinePrecision] - x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]]
\frac{x + \frac{y \cdot z - x}{t \cdot z - x}}{x + 1}
↓
\begin{array}{l}
\mathbf{if}\;z \leq -2.05 \cdot 10^{+178} \lor \neg \left(z \leq 4.25 \cdot 10^{+130}\right):\\
\;\;\;\;\frac{\frac{y}{t} + x}{x + 1}\\
\mathbf{else}:\\
\;\;\;\;\frac{x + \frac{z \cdot y - x}{z \cdot t - x}}{x + 1}\\
\end{array}
Alternatives Alternative 1 Accuracy 94.5% Cost 1353
\[\begin{array}{l}
\mathbf{if}\;z \leq -2.05 \cdot 10^{+178} \lor \neg \left(z \leq 4.25 \cdot 10^{+130}\right):\\
\;\;\;\;\frac{\frac{y}{t} + x}{x + 1}\\
\mathbf{else}:\\
\;\;\;\;\frac{x + \frac{z \cdot y - x}{z \cdot t - x}}{x + 1}\\
\end{array}
\]
Alternative 2 Accuracy 87.7% Cost 1225
\[\begin{array}{l}
t_1 := z \cdot t - x\\
\mathbf{if}\;y \leq -1.9 \cdot 10^{-165} \lor \neg \left(y \leq 2.35 \cdot 10^{-271}\right):\\
\;\;\;\;\frac{x + y \cdot \frac{z}{t_1}}{x + 1}\\
\mathbf{else}:\\
\;\;\;\;\frac{x - \frac{x}{t_1}}{x + 1}\\
\end{array}
\]
Alternative 3 Accuracy 79.1% Cost 1097
\[\begin{array}{l}
\mathbf{if}\;z \leq -2.4 \cdot 10^{-34} \lor \neg \left(z \leq 5.4 \cdot 10^{-168}\right):\\
\;\;\;\;\frac{\frac{y}{t} + x}{x + 1}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \left(x - \frac{y}{\frac{x}{z}}\right)}{x + 1}\\
\end{array}
\]
Alternative 4 Accuracy 75.4% Cost 841
\[\begin{array}{l}
\mathbf{if}\;z \leq -4.5 \cdot 10^{-34} \lor \neg \left(z \leq 1.05 \cdot 10^{-182}\right):\\
\;\;\;\;\frac{\frac{y}{t} + x}{x + 1}\\
\mathbf{else}:\\
\;\;\;\;1\\
\end{array}
\]
Alternative 5 Accuracy 68.6% Cost 713
\[\begin{array}{l}
\mathbf{if}\;x \leq -1.8 \cdot 10^{-66} \lor \neg \left(x \leq 6 \cdot 10^{-68}\right):\\
\;\;\;\;\frac{x}{x + 1}\\
\mathbf{else}:\\
\;\;\;\;\frac{y}{t \cdot \left(x + 1\right)}\\
\end{array}
\]
Alternative 6 Accuracy 68.5% Cost 585
\[\begin{array}{l}
\mathbf{if}\;x \leq -5.4 \cdot 10^{-69} \lor \neg \left(x \leq 1.1 \cdot 10^{-67}\right):\\
\;\;\;\;\frac{x}{x + 1}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\frac{t}{y}}\\
\end{array}
\]
Alternative 7 Accuracy 56.2% Cost 584
\[\begin{array}{l}
\mathbf{if}\;x \leq -8.5 \cdot 10^{-165}:\\
\;\;\;\;1\\
\mathbf{elif}\;x \leq 3.4 \cdot 10^{-11}:\\
\;\;\;\;x - x \cdot x\\
\mathbf{else}:\\
\;\;\;\;1\\
\end{array}
\]
Alternative 8 Accuracy 68.2% Cost 584
\[\begin{array}{l}
\mathbf{if}\;x \leq -2.4 \cdot 10^{-47}:\\
\;\;\;\;1\\
\mathbf{elif}\;x \leq 1.12 \cdot 10^{-68}:\\
\;\;\;\;\frac{1}{\frac{t}{y}}\\
\mathbf{else}:\\
\;\;\;\;1\\
\end{array}
\]
Alternative 9 Accuracy 53.7% Cost 64
\[1
\]