Problema
Rotating a number moves its first digit to the end: 197 becomes 971, then 719. A prime is circular when every rotation is prime too, so 197 is circular. Count the circular primes from 2 to limit. A rotation may be larger than the limit; it still has to be prime.
Implement circular_primes(limit).
Input
limit: The largest number to check.
Output
Return how many primes p ≤ limit are circular.
Restricciones
1 ≤ limit ≤ 100,000
Ejemplos
Entrada:
limit = 20
Salida esperada:
expected = 7
Entrada:
long long limit = 20;
Salida esperada:
long long expected = 7;
Entrada:
long limit = 20;
Salida esperada:
long expected = 7;
Explicación
2, 3, 5, 7, 11, 13 (31 is prime) and 17 (71 is prime) are circular, but 19 is not (91 = 7 × 13): 7.
Entrada:
limit = 1
Salida esperada:
expected = 0
Entrada:
long long limit = 1;
Salida esperada:
long long expected = 0;
Entrada:
long limit = 1;
Salida esperada:
long expected = 0;
Explicación
There are no primes up to 1, so the answer is 0.
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
Rotating once moves the first digit to the end; a d-digit number has d rotations.
Pista 2
Turning the number into a string makes rotation easy.
Pista 3
Rotations can be bigger than the limit, so test them for primality directly.
Complejidad esperada
O(limit × d × √(10^d)) time with trial division, O(d) extra space
Referencias
Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.