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

7
www/statics/euler/Euler_Problem-062_explanation.md Normal file
View File

@@ -0,0 +1,7 @@
Only after at least sixty-two mathematical programs in befunge you will **truly** appreciate a hashtable.
For real, everything would be so much better if I could retrieve this stuff in `O(1)`.
My approach is pretty straight-forward. We calculate an permutation-insensitive hash.
Then store them together with the times it appeared in a hashmap *(I mean a list -.-)*.
Now we just go through all the cubes until a single hash appeared five times. In C# with a Dictionary this takes around 10ms.