import java.util.Scanner;
public class Main {
static final int CONSTANT = 10000;
static final int[] ARRAY = new int[CONSTANT + 1];
static int[] primes = new int[1229];
static {
createPrimes();
}
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
while (scanner.hasNext()) {
int a = scanner.nextInt();
int b = scanner.nextInt();
primeFactors(a, b);
}
}
private static void primeFactors(int a, int b) {
for (; a <= b; a++) {
int temp = a;
System.out.print(a + "=");
int i = 0;
while (temp != 1) {
if (temp % primes[i] == 0) {
temp /= primes[i];
System.out.print(primes[i]);//当除以质数之后余数等于0,输出
System.out.print(temp == 1 ? "\r\n" : "*");//判断商是不是刚好除尽=1,不//是表示要继续除,则添加乘号
} else {
i++;
}
}
}
}
//找出质数(0-constant)
private static void createPrimes() {
for (int i = 2; i <= CONSTANT; i++) {
if (ARRAY[i] == 0) {
for (int j = i * 2; j <= CONSTANT; j += i) {
ARRAY[j] = 1;
}
}
}
int k = 0;
for (int i = 2; i <= CONSTANT; i++) {
if (ARRAY[i] == 0) {
primes[k++] = i;
}
}
}
}
问题描述 求出区间[a,b]中所有整数的质因数分解。输入格式 输入两个整数a,b。输出格式 每行输出一个数的分解,形如k=a1*a2*a3...(a1样例输入3 10样例输出3=34=2*25=56=2*37=78=2*2*29=3*310=2*5提示 先筛出所有素数,然后再分解。数据规模和约定 2import java.util.Scanner;public class Mai