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

25 votes223 views5 answers
Text-decoration
C++
1 vote202 views1 answer
Std::tuple apply multiplier
C++
5 votes194 views2 answers
Use sleep in c in windows
C++
1 vote195 views1 answer
Std::queue
C++
4 votes183 views1 answer
C++ get nth character in string
C++
6 votes187 views6 answers
C++ sort vector
C++
0 vote240 views10 answers
Loop
C++
21 votes240 views6 answers
Cin c++
C++
0 vote189 views7 answers
Online compiler to calculator time complexity
C++
8 votes237 views10 answers
Never gonna give you up
C++