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 votes174 views1 answer
C++ get filename from path
C++
0 vote165 views1 answer
How to declare a 2D vector in c++ of size m*n with value 0
C++
0 vote169 views1 answer
RotateArray
C++
0 vote172 views1 answer
CoinPiles
C++
0 vote177 views1 answer
Cosnt cast
C++
0 vote174 views1 answer
Set width qpushbutton
C++
0 vote164 views1 answer
Character array to string c++ stl
C++
0 vote186 views1 answer
How to write a template c++
C++
3 votes184 views2 answers
Iomanip
C++
0 vote161 views1 answer
Pop back innstring
C++