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

1 vote257 views1 answer
Forward declaration c++
C++
0 vote259 views1 answer
What does catch(...) mean in c++
C++
0 vote280 views1 answer
Simple program for sign in and sign up in c++
C++
1 vote273 views1 answer
Kwakiutl tribe artifacts
C++
0 vote239 views2 answers
Vector to string c++
C++
0 vote263 views3 answers
C++ variable type
C++
0 vote267 views1 answer
C++ unordered_map check if key exists
C++
0 vote280 views2 answers
C++ map key exists
C++
0 vote303 views1 answer
Concatenate two vectors c++
C++
2 votes263 views2 answers
Tolower funciton in cpp
C++