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

6 votes100 views2 answers
Stack erase
C++
1 vote101 views1 answer
Start with pure c++ and opengl gamedev
C++
11 votes102 views1 answer
Removing a character from a string in c++
C++
0 vote88 views1 answer
How to get an element in a list c++
C++
0 vote124 views2 answers
Memory leak in cpp
C++
104 votes234 views6 answers
Integer to string c++
C++
1 vote93 views1 answer
C++ check if string contains non alphanumeric
C++
0 vote100 views1 answer
Uint16_t in c++
C++
3 votes96 views1 answer
Convert refference to pointer c++
C++
0 vote99 views1 answer
Disallowcopy c++
C++