Project Euler #101 10. Project Euler #10 : Sum of primes Difficulty rating is 5%. This problem is calculate the primes below 2 million. The solution is very simple. Get primes below 2 million using sieve of Eratosthenes. There are some Determining algorithms whether number is prime. Miller-rabin, AKS, etc. In order to solve this problem, I think using sieve of Eratosthenes is best. #include #include int main() { int primes[200000]; int count = 0; int6.. 2015. 4. 21. 이전 1 다음