筛法求欧拉函数

输入n,求1-n的欧拉函数是多少

题解

1. 欧拉函数定义，从1到n中与n互质的数字的个数。
2. 欧拉函数的计算式，如果i是质数的话，phi[i] = i - 1,否则就是所有的因子pi, (1 - 1/pi)的乘积，最后在乘以phi[i]。
3. 筛选方法求欧拉函数，使用了素数的线性筛选和欧拉函数的性质。当i % pj == 0的时候，i * pj和i的素数因子种类相同，所以phi[i * pj]的欧拉函数就是phi[i] * pj。否则，pj不是i的素数因子，所以phi[i * pj] = phi[i] * pj * (1 - 1/pj) = phi[i] * (pj - 1)

代码

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.OutputStreamWriter;
import java.util.Scanner;

/**
 * @author: Zekun Fu
 * @date: 2022/11/7 12:17
 * @Description: 欧拉函数,求1-n中与n互素的数字的个数
 */
public class Main{
//    private static final int maxn = 1000000;
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] st = new int[n + 1];
        int[] primes = new int[n + 1];
        int[] phi = new int[n + 1];
        int cnt = 0;
        phi[1] = 1;
        for (int i = 2; i <= n; i++) {
            if (st[i] == 0) {
                primes[cnt++] = i;
                phi[i] = i - 1;
            }
            for (int j = 0; primes[j] <= n / i; j++) {
                st[primes[j] * i] = 1;
                if (i % primes[j] == 0) {   // pj也是i的余数，所以直接pj
                    phi[primes[j] * i] = phi[i] * primes[j];
                    break;
                }                           // pj不是i的余数乘以pj * (pj - 1) / pj
                phi[primes[j] * i] = phi[i] * (primes[j] - 1);
            }
        }
        BufferedWriter out = new BufferedWriter(new OutputStreamWriter(System.out));
        for (int i = 1; i <= n; i++) {
            out.write(phi[i] + "\n");
        }
        out.flush();
        out.close();
    }
}