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

19 votes215 views2 answers
C++ file .
C++
0 vote246 views1 answer
Qrandomgenerator bounded
C++
1 vote236 views1 answer
Flags for g++ compiler
C++
0 vote215 views1 answer
Cstring to string
C++
1 vote227 views1 answer
Expected number of trials to get n consecutive heads
C++
0 vote224 views1 answer
C++ program to find lcm of two numbers
C++
6 votes249 views6 answers
C++ for loop
C++
0 vote214 views1 answer
Swap first and last character of string in c++
C++
0 vote209 views1 answer
Copy file to vector c++
C++
1 vote218 views1 answer
Xmake set exe name
C++