We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Use sieve of eratosthenes, find whether the number and their rotations are prime and add them to a set and find the sum. I have the code in Python if you don't understand~
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #35: Circular primes
You are viewing a single comment's thread. Return to all comments →
Use sieve of eratosthenes, find whether the number and their rotations are prime and add them to a set and find the sum. I have the code in Python if you don't understand~