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 vote164 views1 answer
Implicit conversion casting
C++
0 vote148 views1 answer
String to hexadecimal in c
C++
1 vote212 views1 answer
Double to float c++
C++
0 vote180 views1 answer
C++ simple projects
C++
17 votes175 views4 answers
Max element in vector c++
C++
1 vote177 views1 answer
Vector erase not working c++
C++
2 votes167 views2 answers
C++ starter
C++
0 vote189 views1 answer
C++ array count freqeancy
C++
0 vote155 views1 answer
How to use mersenne_twister_engine in c++ to generate random numbers
C++
0 vote166 views1 answer
Cuda allocate memory
C++