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 vote143 views1 answer
Print hola mundo
C++
0 vote147 views1 answer
C++ code 2d block
C++
-1 vote141 views1 answer
String array 2d c++
C++
0 vote142 views1 answer
I2c slave onreceive
C++
0 vote181 views1 answer
C++ convert const char* to int
C++
0 vote142 views1 answer
C++ find with predicat
C++
18 votes134 views3 answers
How to make a 2d vector in c++
C++
4 votes132 views1 answer
How to compare lower case character to uppercase cpp
C++
24 votes159 views3 answers
C++ function
C++
0 vote148 views1 answer
The number of ones int bitset
C++