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

1 vote87 views1 answer
Xmake run with arg
C++
0 vote98 views1 answer
How to setup glut main loop
C++
1 vote112 views1 answer
Eosio check account exist
C++
1 vote97 views1 answer
What is time complexity of min_element()
C++
1 vote105 views1 answer
Cuda dim3
C++
0 vote97 views1 answer
Run program until ctrl-d c++
C++
-1 vote142 views1 answer
How to replace an element in array in c++
C++
3 votes102 views2 answers
Find maximum sum in array of contiguous subarrays
C++
0 vote103 views1 answer
Fisher–Yates shuffle Algorithm c++
C++
0 vote100 views1 answer
Fill vector with zeros c++
C++