Phi function

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

5 votes203 views6 answers
Ngrok http
C++
0 vote112 views1 answer
C++ clear char array
C++
0 vote117 views2 answers
Power in c++
C++
2 votes125 views1 answer
Web scraping with cpp
C++
0 vote110 views3 answers
If
C++
10 votes114 views2 answers
C++ convert binary string to decimal
C++
1 vote116 views1 answer
Isprime c++
C++
20 votes147 views2 answers
Dev cpp
C++
0 vote159 views1 answer
How to input a file path in c++
C++
4 votes118 views3 answers
C++ how to get maximum value
C++