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

11
www/statics/euler/Euler_Problem-077_explanation.md Normal file
View File

@@ -0,0 +1,11 @@
For an extended explanation please look at problem-076, it's basically the same..
Yet again we remember already calculated values in an grid.
The only difference is now that our y-axis is the prime index (We generate a few primes with an [Sieve of Eratosthenes](https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes)).
And once we find a number which count is greater five thousand we abort and print this number.
The only mayor difference to problem-076 is that now not every summand is valid.
It is possible that you can use `prime[7]` but not `prime[6]`.
So we have to look at each possible summand individually.
This makes unfortunately the optimization where we remember the sum of all values invalid.