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.
Project Euler #41: Pandigital prime
Project Euler #41: Pandigital prime
Contest ends in
Sort by
recency
|
30 Discussions
|
Please Login in order to post a comment
python 100%
JAva Code
Here is my C# 100 Points Solution
Easy solve, 100/- points python 3
If this helps anyone: 1. Don't use sieve of eratosthenes as it gives memory error instead use is_prime function 2. Use direct "12","123",...strings in a list 3. Find all permutations of above string outside the for loop in separate generalized function 4. Use binary search. I got time error in last 4 but was fixed after using binary search