OJ Board

Use long long int.

Your code takes so many times when the input is 1 999999.
You should use faster and most efficient sieve for this problem.
Just think about it." The sum of the digits of a prime number is prime or not''- it can be checked very simply,think about those primes.
Best of luck !!!!!!!!!!!!!!

Maruf check this input.......... output: Hope you will get acc soon.

To daichin85,
You should read the input such a way that the differences between adjacent numbers must cover all the numbers from 1 to n-1.
Good luck!!!!!!!!!!!!