Skip to content

Latest commit

 

History

History
123 lines (47 loc) · 1.52 KB

File metadata and controls

123 lines (47 loc) · 1.52 KB

中文文档

Description

Find the smallest prime palindrome greater than or equal to N.

Recall that a number is prime if it's only divisors are 1 and itself, and it is greater than 1. 

For example, 2,3,5,7,11 and 13 are primes.

Recall that a number is a palindrome if it reads the same from left to right as it does from right to left. 

For example, 12321 is a palindrome.

 

Example 1:

Input: 6

Output: 7

Example 2:

Input: 8

Output: 11

Example 3:

Input: 13

Output: 101

 

Note:

    <li><code>1 &lt;= N &lt;= 10^8</code></li>
    
    <li>The answer is guaranteed to exist and be less than <code>2 * 10^8</code>.</li>
    

Solutions

Python3

Java

...