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

30 votes190 views2 answers
Integer range in c++
C++
0 vote204 views1 answer
Create vector of specific size c++
C++
0 vote215 views1 answer
Fstring from float c++ ue4
C++
0 vote181 views1 answer
What is imposter syndrome
C++
1 vote198 views1 answer
Sum of stack c++
C++
5 votes194 views2 answers
Vbs check if file exists
C++
1 vote211 views1 answer
Stack implementation using linked list in cpp
C++
4 votes178 views1 answer
How to make i/o fast in c++
C++
0 vote185 views1 answer
C++ iterate over vector of pointers
C++
2 votes191 views1 answer
Hwo to calculate the number of digits using log in c++
C++