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 vote341 views1 answer
Add two constant char pointers c++
C++
0 vote276 views1 answer
Prefix array algorithm in c++
C++
0 vote294 views5 answers
C to c++ code converter
C++
0 vote346 views1 answer
Print elements of linked list
C++
0 vote323 views1 answer
Appending string in c++
C++
1 vote365 views1 answer
Get ascii value of qchar
C++
0 vote329 views1 answer
Xor in c++
C++
4 votes346 views2 answers
Round double to n decimal places c++
C++
0 vote332 views1 answer
Get player pawn
C++
22 votes338 views2 answers
DateFormat in Flutter
C++