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 vote141 views1 answer
C++ simple projects
C++
0 vote168 views1 answer
File streams in c++
C++
0 vote115 views1 answer
Vermífugo significado
C++
2 votes122 views1 answer
Binary search return index c++
C++
1 vote131 views1 answer
Arduino Sring to const char
C++
10 votes119 views3 answers
Initialise 2d vector in c++
C++
0 vote130 views1 answer
Pretty Print c++ chegg
C++
0 vote133 views1 answer
Days in a year c++
C++
0 vote143 views2 answers
Qpushbutton clicked connect c++
C++
0 vote137 views1 answer
C++ load file as vector
C++