"Mirror prime" numbers
We will call a number "mirror prime", if it is simple, and the number written down by those numbers in a back order is simple.
On the set from A to B find the amount of "mirror prime" numbers.
Specifications
Input
On the entrance is given a 2 number À and Â. (1 ≤ A, B ≤ 10000)
Output
A singular is the sought after amount of "mirror prime" numbers.
Problem information
Time Limit: 1 secondsMemory Limit: 64 MB
Balls for the passed test: 10
Complexity: 36% 421/662
My result: 0/1
Example
Example input10 25 |
Example output3 |
| ← Corruption | Problems | New-year tree → |
