Problema
Take every a and every b from lo to hi and compute a^b. Some values repeat, like 2^4 = 4^2 = 16. Count how many different values there are. The values are huge, but you never need them: write a as r^k where r is not itself a perfect power, and a^b = r^(k × b). Two powers are equal exactly when they share the same r and the same exponent k × b.
Implement distinct_powers(lo, hi).
Input
lo: The smallest base and exponent.
hi: The largest base and exponent.
Output
Return the number of distinct values of a^b with lo ≤ a ≤ hi and lo ≤ b ≤ hi.
Restricciones
2 ≤ lo ≤ hi ≤ 100
Ejemplos
Entrada:
lo = 2
hi = 4
Salida esperada:
expected = 8
Entrada:
long long lo = 2;
long long hi = 4;
Salida esperada:
long long expected = 8;
Entrada:
long lo = 2;
long hi = 4;
Salida esperada:
long expected = 8;
Explicación
The nine powers are 4, 8, 16, 9, 27, 81, 16, 64, 256. 16 appears twice, so there are 8 distinct values.
Entrada:
lo = 7
hi = 7
Salida esperada:
expected = 1
Entrada:
long long lo = 7;
long long hi = 7;
Salida esperada:
long long expected = 1;
Entrada:
long lo = 7;
long hi = 7;
Salida esperada:
long expected = 1;
Explicación
Only 7^7, so 1.
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
Find the smallest r and largest k with r^k = a.
Pista 2
a^b equals r^(k × b), so the pair (r, k × b) identifies the value.
Pista 3
Put the pairs in a set and count them.
Complejidad esperada
O((hi − lo)² log hi) time, O((hi − lo)²) extra space
Referencias
Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.