算法之数学知识

一、质数

1.判断质数

	static boolean check(long x){
        if(x<2)return false;
        for(int i=2;i<=x/i;i++){
            if(x%i==0)return false;
        }
        return true;
    }

2.分解质因数

	static void cal(int x){
	    for(int i=2;i<=x/i;i++){
	        if(x%i==0){
	            int cnt=0;
	            while(x%i==0){
	                x=x/i;
	                cnt++;
	            }
	            System.out.println(i+" "+cnt);
	        }
	    }
	    if(x>1){
	        System.out.println(x+" "+1);
	    }
	}

3.筛质数

//朴素筛法
	import java.util.*;

	public class Main {
	static int cnt;
	static final int N = 1000010;
	static int[] primes = new int[N];
	static boolean[] st = new boolean[N];

	static void get_primes(int n) {
		for (int i = 2; i <= n; i++) {
			if (st[i])
				continue;
			primes[cnt++] = i;
			for (int j = i + i; j <= n; j += i) {
				st[j] = true;
			}
		}
	}
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		get_primes(n);
		System.out.println(cnt);
	}
}

//线性筛法
	static void get_primes(int n) {
		for (int i = 2; i <= n; i++) {
			if (!st[i]) {
				primes[cnt++] = i;
			}
			for (int j = 0; primes[j] <= n/i; j++) {
				st[primes[j] * i] = true;
				if (i % primes[j] == 0)
					break;
			}
		}
	}

二、约数

1.试除法求约数

	static void get_divisors(int n) {
		TreeSet<Integer> set = new TreeSet<>();
		for (int i = 1; i <= n / i; i++) {
			if (n % i == 0) {
				set.add(i);
				if (i != n / i) {
					set.add(n / i);
				}
			}
		}
		Iterator<Integer> it = set.iterator();
		while (it.hasNext()) {
			System.out.print(it.next() + " ");
		}
		System.out.println();
	}

2.约数个数

N=P₁^a1×P₂^a2×…×P_k^ak

约数个数 = (a1+1)(a2+1)…(ak+1)

约数之和 = (p₁⁰+p₁¹+…+p₁^a1)(p₂⁰+p₂¹+…+p₂^a2)…(p_k⁰+p_k¹+…+p_k^ak)

给定n个整数ai，输出这些数的乘积的约数个数

	import java.util.*;

	public class Main {

	static final int mod = (int) 1e9 + 7;

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		HashMap<Integer, Integer> map = new HashMap<>();
		int n = in.nextInt();
		while ((n--) > 0) {
			int x = in.nextInt();
			for (int i = 2; i <= x / i; i++) {
				while (x % i == 0) {
					x = x / i;
					map.put(i, map.getOrDefault(i, 0) + 1);
				}
			}
			if (x > 1) {
				map.put(x, map.getOrDefault(x, 0) + 1);
			}
		}
		int res = 1;
		for (int v : map.values()) {
			res = res * (v+1) % mod;
		}
		System.out.println(res);
	}
}

3.约数之和

给定n个整数ai，输入这些数的乘积的约数之和

	for (int key : map.values()) {
		int p = key, a = map.get(key);
		long t = 1;
		while ((a--) > 0) {
			t = (t * p + 1);//秦九韶算法
		}
		res = res * t % mod;
	}

4.最大公约数

//辗转相除法
	static int gcd(int p, int q) {
		return q != 0 ? gcd(q, p % q) : p;
	}

补充：秦九韶算法

f(x) = a_nxⁿ+a_n-1x^n-1+…+a₁x+a₀ = (…(a_nx+a_n-1)x+a_n-2)x+…+a₁)x+a₀

	static int f(int n, int a[], int x) {
		int p = a[n];
		for (int i = n-1; i >= 0; i--) {
			p = p * x + a[i];
		}
		return p;
	}