HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Volumes > Functions > problem:


145. 50586 - Prime Palindromes

Guest
• Review clarifications (2)

Volume problems

• 50307 - Palindromes
• 50305 - John's Tasks
• 002. 50428 - Three Times
• 010. 50582 - Number of digits
• 035. 50467 - Random Numbers
• 062. 50390 - Total Salary Paid
• 100. 50397 - The Number of Points ...
• 135. 50572 - Palindromic Numbers
• 145. 50586 - Prime Palindromes
• 160. 50571 - Armstrong Numbers - 2
• 50315 - Pig Latin
• 50353 - Cube of the Largest number
• 50296 - Total Discount Rate
• 50559 - Prime Factors of a Number
• 040. 50354 - Intersecting Rectangles
• 060. 50727 - Fibonacci Numbers
• 061. 50733 - The Highest Average

Feedback

If you notice incorrect translations in Contester, please let author know.

Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.
Prepared by Ibrahim Mesecan.

Prime Palindromes

Shqip
A prime number is a natural number that has exactly two distinct natural number divisors: 1 and itself.
A palindromic number is a 'symmetrical' number like 16461, that remains the same when its digits are reversed.
A number is prime palindrome if it's at the same time prime and palindromic number. Write a program that finds the number of prime palindromic numbers between two given numbers: m and n.
For example: If m and n are given : 10000 12000 Then the prime palindromic numbers are: 10301 10501 10601 11311 11411.

Input specification
There will be two numbers in the input file which are between 1 ≤ n < m ≤ 100000.

Output specification
Find the number of prime palindromic numbers between the given numbers. If there is no prime palindromic number within the given range show 0 (zero).

Input
10000 12000
Output
5

Для отправки решений необходимо выполнить вход.

www.contester.ru