Phi function (n log (log(n)))

int phi(int n) {
    int result = n;
    for (int i = 2; i * i <= n; i++) {
        if (n % i == 0) {
            while (n % i == 0)
                n /= i;
            result -= result / i;
        }
    }
    if (n > 1)
        result -= result / n;
    return result;
}

Source: cp-algorithms.com

Similar codes

0 vote286 views1 answer
CamelCase Problem
C++
0 vote287 views1 answer
The question for me
C++
6 votes295 views1 answer
C++ estimate deciimal to a point
C++
7 votes265 views1 answer
C++ create class from class name
C++
0 vote261 views1 answer
Number of nodes of bst cpp
C++
0 vote287 views1 answer
Pointeur cpp
C++
0 vote315 views1 answer
Shift element to end of vector c++
C++
0 vote268 views1 answer
Distructor of the node of the link list
C++
1 vote290 views1 answer
Include guard c++
C++
0 vote278 views1 answer
C++ konsolenausgabe
C++