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

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
Signed by: Mikescher
GPG Key ID: D3C7172E0A70F8CF
5 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
www/statics/blog/funupdate.md
View File

@ -1,4 +1,4 @@
After a lot of requests i come to update the [Fun-Page](/fun/fun.php). After a lot of requests i come to update the Fun-Page.
The flying parts are now a good amount slower and the colors not *that* bright ... The flying parts are now a good amount slower and the colors not *that* bright ...
Complaints can go into the guestbook. Complaints can go into the guestbook.

2
www/statics/blog/more_euler.md
View File

@ -1,4 +1,4 @@
A lot of you probably have seen [various](/programs/view/BefunUtils) [befunge](/programs/view/BefunZ) [stuff](https://github.com/Mikescher/BefunUtils) on this site. A lot of you probably have seen [various](/programs/view/BefunUtils) [befunge](/programs/view/BefunUtils) [stuff](https://github.com/Mikescher/BefunUtils) on this site.
But a thing I do now for a while is solving the **[Project Euler](https://projecteuler.net/)** problems in befunge. But a thing I do now for a while is solving the **[Project Euler](https://projecteuler.net/)** problems in befunge.
To celebrate fifty solved levels I want to rally you again to my **[blogpost about this project](/blog/1/Project_Euler_with_Befunge)** and the [table](/blog/1/Project_Euler_with_Befunge) with all my solved problems. To celebrate fifty solved levels I want to rally you again to my **[blogpost about this project](/blog/1/Project_Euler_with_Befunge)** and the [table](/blog/1/Project_Euler_with_Befunge) with all my solved problems.

2
www/statics/blog/spammers.md
View File

@ -6,4 +6,4 @@ Btw, i took the "fun" path and tried writing my own captcha code, here you can s
![Captcha][1] ![Captcha][1]
[1]: /images/log/captcha_img.png [1]: /data/images/log/captcha_img.png

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)). 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. 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... 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" 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. 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 However, there are up to three "shortest" path candidates for any given cuboid and
the shortest route doesn't always have integer length. the shortest route doesn't always have integer length.