Mikescher/www.mikescher.com
1
0
Fork 0
Code Actions Activity

more broken links

Browse Source
This commit is contained in:
Mike Schwörer
2018-02-03 18:49:23 +01:00
parent 1ee2563efc
commit 65eec53c27
5 changed files with 5 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
www/statics/euler/Euler_Problem-044_explanation.md
View File

@@ -4,5 +4,5 @@ The problem is that you need a square root to inverse the pentagonal formula and
So I needed to implement my own version of integer square roots in Befunge (see [wikipedia](https://en.wikipedia.org/wiki/Methods_of_computing_square_roots)).
The program is still not really fast but it's good that I managed to speed it up to a time where you can execute it without waiting the whole night.
Also this program is nicely compact, by the time I'm writing this my Befunge interpreter [BefunExec](https://www.mikescher.de/programs/view/BefunUtils) has gotten a display of all possible paths a program can take.
Also this program is nicely compact, by the time I'm writing this my Befunge interpreter [BefunExec](https://www.mikescher.com/programs/view/BefunUtils) has gotten a display of all possible paths a program can take.
And if you look at the graph of this program, it looks pretty interesting...

2
www/statics/euler/Euler_Problem-086_description.md
View File

@@ -3,7 +3,7 @@ and a fly, **F**, sits in the opposite corner.
By travelling on the surfaces of the room the shortest "straight line"
distance from **S** to **F** is 10 and the path is shown on the diagram.
![img](/data/blog/Befunge/p086.gif)
![img](/data/images/blog/p085.gif)
However, there are up to three "shortest" path candidates for any given cuboid and
the shortest route doesn't always have integer length.