weixin_45948204的博客

import java.util.Arrays;import java.util.Scanner;public class Main { static int[] prime = new int[1000005]; static boolean[] vis = new boolean[1000005]; public static void main(String[] args) { Scanner sc = new Scanner(System.in); while(sc.hasNex

整数分解定理：A = p1^k1 * p2^k2 * … * pn^kn;整数分解后的约数和公式：sum = (1+p1+p12+p13+…p1^k1) * (1+p2+p22+p23+….p2^k2) * (1+p3+ p3^3+…+ p3^k3) * … * (1+pn+pn2+pn3+…pn^kn)递归二分求等比数列：1+p+p^2+ p3+p3+…+p^nn为奇数时，(1 + p + p^2 +…+ p^(n/2)) * (1 + p^(n/2+1))；n为偶数时，(1 + p + p