求一个数的所有素因子

public class Main {
	public static void main(String args[]) {
		Scanner scan = new Scanner(System.in);
		long n = scan.nextLong();
		long q = (long) Math.sqrt(n + 1);
		long a[] = new long[500000];
		int E = 0;
		for(int i = 2 ; i < q ; i++) {
			if(n % i == 0) {
				a[E++] = i;
				while(n%i == 0) {
					n/=i;
				}
			}
		}
		if(n != 1) a[E++] = n; 
	}
}

快速求1--n的所有数的素因子

public class Main {
	public static void main(String args[]) {
		Scanner scan = new Scanner(System.in);
		long n = scan.nextLong();
		int vis[] = new int[100000];
		int l[] = new int[100000];
		int s[][] = new int[100000][100];
		for(int i = 2 ; i < n ; i++) {
			if(vis[i] == 0) {
				for(int j = i ; j < n ; j+=i) {
					s[j][l[j]++] = i;
					vis[j]=1;
				}
			}
		}
		for(int i = 0; i < l[6] ; i++) {
			System.out.println(s[6][i]);
		}
		 
	}
}