Solution another YandexQ question via sieve of eratosthenes in Python

Posted by dba477 on Oct 10, 2021 8:49 AM EDT
https://dbaxps.blogspot.com/; By Boris Derzhavets 		Mail this story
Print this story

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

Full Story

  Nav
» Read more about: Story Type: Tutorial; Groups: Developer, Fedora, Python

« Return to the newswire homepage

This topic does not have any threads posted yet!

You cannot post until you login.