##05AB1E, 22 bytes, Emigna
05AB1E, 22 bytes, Emigna
è›1DDLÏ_zTnF©1®/+;}1DP
Most probably not what was intended, but works ;)
Everything before T is just byte wasting (but which leaves the stack empty), then it does a 100 Newton iterations, which yields a good enough approximation of the square root, then pushes the input twice and returns the product of the whole stack, thus giving the desired output.
Example runs:
$ echo 0 | ./05AB1E.py -e 'è›1DDLÏ_zTnF©1®/+;}1DP'
0.0
$ echo 4 | ./05AB1E.py -e 'è›1DDLÏ_zTnF©1®/+;}1DP'
32.0
$ echo 6 | ./05AB1E.py -e 'è›1DDLÏ_zTnF©1®/+;}1DP'
88.18163074019441
$ echo 25 | ./05AB1E.py -e 'è›1DDLÏ_zTnF©1®/+;}1DP'
3125.0
$ echo 7131 | ./05AB1E.py -e 'è›1DDLÏ_zTnF©1®/+;}1DP'
4294138928.896773
##05AB1E, 22 bytes, Emigna
è›1DDLÏ_zTnF©1®/+;}1DP
Most probably not what was intended, but works ;)
Everything before T is just byte wasting (but which leaves the stack empty), then it does a 100 Newton iterations, which yields a good enough approximation of the square root, then pushes the input twice and returns the product of the whole stack, thus giving the desired output.
Example runs:
$ echo 0 | ./05AB1E.py -e 'è›1DDLÏ_zTnF©1®/+;}1DP'
0.0
$ echo 4 | ./05AB1E.py -e 'è›1DDLÏ_zTnF©1®/+;}1DP'
32.0
$ echo 6 | ./05AB1E.py -e 'è›1DDLÏ_zTnF©1®/+;}1DP'
88.18163074019441
$ echo 25 | ./05AB1E.py -e 'è›1DDLÏ_zTnF©1®/+;}1DP'
3125.0
$ echo 7131 | ./05AB1E.py -e 'è›1DDLÏ_zTnF©1®/+;}1DP'
4294138928.896773
05AB1E, 22 bytes, Emigna
è›1DDLÏ_zTnF©1®/+;}1DP
Most probably not what was intended, but works ;)
Everything before T is just byte wasting (but which leaves the stack empty), then it does a 100 Newton iterations, which yields a good enough approximation of the square root, then pushes the input twice and returns the product of the whole stack, thus giving the desired output.
Example runs:
$ echo 0 | ./05AB1E.py -e 'è›1DDLÏ_zTnF©1®/+;}1DP'
0.0
$ echo 4 | ./05AB1E.py -e 'è›1DDLÏ_zTnF©1®/+;}1DP'
32.0
$ echo 6 | ./05AB1E.py -e 'è›1DDLÏ_zTnF©1®/+;}1DP'
88.18163074019441
$ echo 25 | ./05AB1E.py -e 'è›1DDLÏ_zTnF©1®/+;}1DP'
3125.0
$ echo 7131 | ./05AB1E.py -e 'è›1DDLÏ_zTnF©1®/+;}1DP'
4294138928.896773
##05AB1E, 22 bytes, Emigna Emigna
è›1DDLÏ_zTnF©1®/+;}1DP
Most probably not what was intended, but works ;)
Everything before T is just byte wasting (but which leaves the stack empty), then it does a 100 Newton iterations, which yields a good enough approximation of the square root, then pushes the input twice and returns the product of the whole stack, thus giving the desired output.
Example runs:
$ echo 0 | ./05AB1E.py -e 'è›1DDLÏ_zTnF©1®/+;}1DP'
0.0
$ echo 4 | ./05AB1E.py -e 'è›1DDLÏ_zTnF©1®/+;}1DP'
32.0
$ echo 6 | ./05AB1E.py -e 'è›1DDLÏ_zTnF©1®/+;}1DP'
88.18163074019441
$ echo 25 | ./05AB1E.py -e 'è›1DDLÏ_zTnF©1®/+;}1DP'
3125.0
$ echo 7131 | ./05AB1E.py -e 'è›1DDLÏ_zTnF©1®/+;}1DP'
4294138928.896773
##05AB1E, 22 bytes, Emigna
è›1DDLÏ_zTnF©1®/+;}1DP
Most probably not what was intended, but works ;)
Everything before T is just byte wasting (but which leaves the stack empty), then it does a 100 Newton iterations, which yields a good enough approximation of the square root, then pushes the input twice and returns the product of the whole stack, thus giving the desired output.
Example runs:
$ echo 0 | ./05AB1E.py -e 'è›1DDLÏ_zTnF©1®/+;}1DP'
0.0
$ echo 4 | ./05AB1E.py -e 'è›1DDLÏ_zTnF©1®/+;}1DP'
32.0
$ echo 6 | ./05AB1E.py -e 'è›1DDLÏ_zTnF©1®/+;}1DP'
88.18163074019441
$ echo 25 | ./05AB1E.py -e 'è›1DDLÏ_zTnF©1®/+;}1DP'
3125.0
$ echo 7131 | ./05AB1E.py -e 'è›1DDLÏ_zTnF©1®/+;}1DP'
4294138928.896773
##05AB1E, 22 bytes, Emigna
è›1DDLÏ_zTnF©1®/+;}1DP
Most probably not what was intended, but works ;)
Everything before T is just byte wasting (but which leaves the stack empty), then it does a 100 Newton iterations, which yields a good enough approximation of the square root, then pushes the input twice and returns the product of the whole stack, thus giving the desired output.
Example runs:
$ echo 0 | ./05AB1E.py -e 'è›1DDLÏ_zTnF©1®/+;}1DP'
0.0
$ echo 4 | ./05AB1E.py -e 'è›1DDLÏ_zTnF©1®/+;}1DP'
32.0
$ echo 6 | ./05AB1E.py -e 'è›1DDLÏ_zTnF©1®/+;}1DP'
88.18163074019441
$ echo 25 | ./05AB1E.py -e 'è›1DDLÏ_zTnF©1®/+;}1DP'
3125.0
$ echo 7131 | ./05AB1E.py -e 'è›1DDLÏ_zTnF©1®/+;}1DP'
4294138928.896773
##05AB1E, 22 bytes, Emigna
è›1DDLÏ_zTnF©1®/+;}1DP
Most probably not what was intended, but works ;)
Everything before T is just byte wasting (but which leaves the stack empty), then it does a 100 Newton iterations, which yields a good enough approximation of the square root, then pushes the input twice and returns the product of the whole stack, thus giving the desired output.
Example runs:
$ echo 0 | ./05AB1E.py -e 'è›1DDLÏ_zTnF©1®/+;}1DP'
0.0
$ echo 4 | ./05AB1E.py -e 'è›1DDLÏ_zTnF©1®/+;}1DP'
32.0
$ echo 6 | ./05AB1E.py -e 'è›1DDLÏ_zTnF©1®/+;}1DP'
88.18163074019441
$ echo 25 | ./05AB1E.py -e 'è›1DDLÏ_zTnF©1®/+;}1DP'
3125.0
$ echo 7131 | ./05AB1E.py -e 'è›1DDLÏ_zTnF©1®/+;}1DP'
4294138928.896773