Problema
Euler's totient function φ(n) counts the integers k with 1 ≤ k ≤ n and gcd(k, n) = 1. For example, φ(9) = 6, because 1, 2, 4, 5, 7 and 8 have no common factor with 9.
Implement eulers_totient(n).
Counting one k at a time is too slow for n up to 10^12. Use the product formula instead: φ(n) = n × (1 − 1/p) for every distinct prime p that divides n. Doing it in integers as n / p × (p − 1) avoids fractions.
Input
n: A positive integer.
Output
Return φ(n). By the definition φ(1) = 1.
Restricciones
1 ≤ n ≤ 10^12
Ejemplos
Entrada:
n = 36
Salida esperada:
expected = 12
Entrada:
long long n = 36;
Salida esperada:
long long expected = 12;
Entrada:
long n = 36;
Salida esperada:
long expected = 12;
Explicación
36 = 2² × 3², so φ(36) = 36 × (1 − 1/2) × (1 − 1/3) = 36 × 1/2 × 2/3 = 12.
Entrada:
n = 13
Salida esperada:
expected = 12
Entrada:
long long n = 13;
Salida esperada:
long long expected = 12;
Entrada:
long n = 13;
Salida esperada:
long expected = 12;
Explicación
13 is prime, so every k from 1 to 12 is coprime to it and φ(13) = 12.
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
Factor n by trial division up to √n.
Pista 2
For each distinct prime p, replace the result by result / p × (p − 1); divide first so the value stays small.
Pista 3
A leftover factor above 1 after the loop is a prime too.
Complejidad esperada
O(√n) time, O(1) extra space
Referencias
Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.