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

2 votes329 views1 answer
How to hide ui elements unity
C++
0 vote366 views1 answer
Lnk2001 unresolved external symbol __imp_PlaySoundA
C++
1 vote328 views1 answer
C++ power
C++
0 vote373 views1 answer
C++ load file as vector
C++
-2 votes369 views1 answer
Sum array c++
C++
4 votes325 views2 answers
String count occurrences c++
C++
0 vote337 views1 answer
Why do men drink liquor
C++
2 votes317 views1 answer
Cin.tie c++
C++
3 votes499 views3 answers
Class cpp
C++
3 votes373 views2 answers
C++ code for quicksort
C++