两种方法都是直接根据定义来求,
φ(n)=n(1 - 1/p1) (1 - 1/p2) (1 - 1/p3) (1 - 1/p4)…..(1 - 1/pk)
e[i] == i 与 x % i == 0 均起到了保证 i 为质数的作用,
下面直接看代码
1.
递推:
void euler() {
e[1] = 0;
for (int i = 2; i <= maxn; ++i) e[i] = i;
for (int i = 2; i <= maxn; ++i) {
if (e[i] == i) {
for (int j = i; j <= maxn; j += i) {
e[j] = e[j] / i * (i - 1);
}
}
}
}
2.
线性筛:
void euler2() {
int tot = 0;
e[1] = 1;
for (int i = 2; i <= maxn; ++i) {
if (!check[i]) {
prime[tot++] = i;
e[i] = i - 1;
}
for (int j = 0; j < tot; ++j) {
if (i * prime[j] > maxn) break;
check[i * prime[j]] = true;
if (i % prime[j]) e[i * prime[j]] = e[i] * (prime[j] - 1);
else {
e[i * prime[j]] = e[i] * prime[j];
break;
}
}
}
e[1] = 0;
}
直接求:
LL phi(LL x) {
LL ans = x;
for (LL i = 2; i * i <= x; ++i) {
if (x % i == 0) {
ans -= ans / i;
while (x % i == 0) x /= i;
}
}
if (x > 1) ans -= ans / x;
return ans;
}