LXer: Solution another YandexQ question via sieve of eratosthenes in Python
Published at LXer:
The major target of this approach is performance improvement when looking for the highest prime number less than 10.000.000 with a given sum of decimal digits. The problem requires implementation of sieve of Eratosthenes Read More... |
All times are GMT -5. The time now is 07:39 AM. |