Problem Statement | | | A positive integer is called a prime if it has exactly two distinct positive integer divisors: 1 and itself.
The first few primes are 2, 3, 5, 7, 11, 13, ...
A positive integer is called a palindrome if its base-10 representation reads the same forwards and backwards.
Some palindromes: 2, 77, 101, 33333, 12344321.
A positive integer is called a palindromic prime if it is both a palindrome and a prime.
You are given two ints: L and R.
Compute and return the number of palindromic primes between L and R, inclusive. | | | Definition | | | | Class: | PalindromePrime | | Method: | count | | Parameters: | int, int | | Returns: | int | | Method signature: | int count(int L, int R) | | (be sure your method is public) |
| | | | | | Notes | | - | The number 1 is not a prime number. | | | Constraints | | - | L will be between 1 and 1,000, inclusive. | | - | R will be between L and 1,000, inclusive. | | | Examples | | 0) | | | | | Returns: 2 | | This range contains only two palindromic primes: 101 and 131. |
|
| | 1) | | | | | Returns: 4 | | The palindromic primes in this range are 2, 3, 5, and 7. |
|
| | 2) | | | | | | 3) | | | | | | 4) | | | | |
This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2024, TopCoder, Inc. All rights reserved.
|
