// Louis Casillas, oxaric@gmail.com // Further Edits: Fahad Uddin // Modified a little by Jeffrin Jose T // Euler Problem #10 // Find the sum of all the primes below two million. #include #include char isPrime( int num ) { if ((num % 3) == 0 ) { return 0; } int i = 0; …
Continue reading “How to write a program to solve project euler problem 10 ?”