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

8
www/statics/euler/Euler_Problem-030_explanation.md Normal file
View File

@@ -0,0 +1,8 @@
**Yes**. This is in fact the first program without *put* or *get* instructions. It operates completely on the stack. And that makes it **really** fast.
But *- to be fair -* the algorithm is pretty simple:
First get the upper bound for our later search, we search for a number where `digitcount(9^5 * n) <= n`
After our algorithm calculated that number (I resisted the urge to hard code `354294`) we test every number from 0 to limit and sum the fitting ones (there are only 6).
`4150`, `4151`, `54748`, `92727`, `93084`, `194979`