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 vote331 views1 answer
Hamming c++
C++
0 vote317 views1 answer
Implicit conversion casting
C++
1 vote396 views1 answer
Default access modifier in c++ in struct
C++
1 vote316 views2 answers
Ue4 c++ enumaeration
C++
0 vote323 views1 answer
No indentation latex
C++
0 vote317 views6 answers
Template c++
C++
0 vote319 views1 answer
Mt19937 example c++
C++
2 votes346 views1 answer
What language is ethereum written in
C++
1 vote311 views3 answers
C++ if example
C++
0 vote349 views1 answer
Delete a node from binery search tree c++
C++