10235 - Simply Emirp

Difficulty : easy

Solution Description :

Prime number problem

Use the Sieve of Eratosthenes to generate the primes up to 1,000,000.
For each input n
if n is not equal reverse(n) and n is prime and reverse(n) is prime then
    print is emirp
else if n is prime
    print is prime
else
    print is not prime