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

rename statics/euler and sync b93 code with main repo

Browse Source
This commit is contained in:
Mike Schwörer
2017-11-20 17:38:54 +01:00
parent 0efeb3afeb
commit 69e3f51730
409 changed files with 745 additions and 509 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
www/statics/euler/Euler_Problem-064_explanation.md Normal file
View File

@@ -0,0 +1,9 @@
For this I had to re-use my old [integer-squareroot](https://en.wikipedia.org/wiki/Integer_square_root) implementation
and I ported an [algorithm](http://www.maths.surrey.ac.uk/hosted-sites/R.Knott/Fibonacci/cfINTRO.html#section7) for calculating the continued fraction to befunge.
The rest is just iterating through all the values and trying to optimize for speed.
Here two useful snippets I made while solving this puzzle:
- Calculating the **sum** of an zero-terminated array on the stack: `>\# :#+_+`
- Calculating the **count** of an zero-terminated array on the stack: `0>\#+ #1:#$_$`