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

6
www/statics/euler/Euler_Problem-063_explanation.md Normal file
View File

@@ -0,0 +1,6 @@
After all the previous programs, this one is surprisingly ... dense (the main code-block is 54x8).
The algorithm is quickly explained for each length n we calculate the numbers `1^n`, `2^n` ... until `9^n` and see which have a length of `n`.
(From `10^n` upwards the condition is impossible, because `10^n` has `(n+1)` digits).
The main problem is that the numbers exceed Int64. So we need to implement long multiplication ... again. (see problem 16, 20, 29, 56 and 57)