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

-2 votes290 views1 answer
How to iterate through array in c++
C++
0 vote266 views1 answer
Stringstream stream number to string
C++
0 vote260 views1 answer
Transpose function example in c++
C++
0 vote278 views1 answer
Namespace c++
C++
0 vote269 views1 answer
How to rotate canvas android
C++
0 vote271 views1 answer
Shuffle elements c++
C++
0 vote248 views1 answer
C++ add everything in a vector
C++
0 vote285 views4 answers
How to make a square root function in c++ without stl
C++
8 votes273 views3 answers
C++ min
C++
0 vote270 views1 answer
C++ message box error
C++