Problème
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.
Contraintes
2 ≤ lo ≤ hi ≤ 100
Exemples
Entrée :
lo = 2
hi = 4
Sortie attendue :
expected = 8
Entrée :
long long lo = 2;
long long hi = 4;
Sortie attendue :
long long expected = 8;
Entrée :
long lo = 2;
long hi = 4;
Sortie attendue :
long expected = 8;
Explication
The nine powers are 4, 8, 16, 9, 27, 81, 16, 64, 256. 16 appears twice, so there are 8 distinct values.
Entrée :
lo = 7
hi = 7
Sortie attendue :
expected = 1
Entrée :
long long lo = 7;
long long hi = 7;
Sortie attendue :
long long expected = 1;
Entrée :
long lo = 7;
long hi = 7;
Sortie attendue :
long expected = 1;
Explication
Only 7^7, so 1.
Comment l'aborder
Essayez d'abord seul, puis ouvrez les indices un par un.
Indice 1
Find the smallest r and largest k with r^k = a.
Indice 2
a^b equals r^(k × b), so the pair (r, k × b) identifies the value.
Indice 3
Put the pairs in a set and count them.
Complexité attendue
O((hi − lo)² log hi) time, O((hi − lo)²) extra space
Références
Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.