HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Sections > Search > problem:


50586 - Prime Palindromes

Guest
• Review clarifications (2)

Section problems

• 50238 - The smallest number
• 50437 - Age Labeling
• 50457 - The Number of Winners
• 50478 - Letter Grades
• 50782 - Max of N integers
• 50552 - Casual shoes
• 50562 - List of students
• 50570 - Prime numbers in the seg...
• 50586 - Prime Palindromes
• 50783 - The smallest number
• Raporti Javor
• 50331 - Number of Numbers over A...
• 50465 - How many students have p...
• 50450 - Last Appereance of a Number
• 50378 - Sum of the given digits
• 50458 - Weekly Report
• 50589 - The Number of Eggs Sold

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