967 - Circular
Solution Description : Math Prime Number problem pregenerate prime number up to 1000000. and pre-generate all circular number set count[1]=0 for i=2 to 1000000 ----if i is a prime then you need to find is i Circular prime ----if i is Circular prime then set count[i] = count[i-1] + 1; ----else count[i]= count[i-1] Input i and j set ans = count[j] - count[i-1] Do not forget about print "Prime" for 1 Circular number and "Primes" for more then 1 Circular number. |
||||||||||