参考代码:
import java.lang.annotation.Retention; import java.util.ArrayList; import java.util.Collections; import java.util.Scanner; public class 因式分解 { /** * @param args */ static ArrayList<Integer> arrayList = new ArrayList<Integer>(); public static void main(String[] args) { // TODO Auto-generated method stub //1903: [蓝桥杯][算法提高VIP]因式分解 Scanner scanner = new Scanner(System.in); int a = scanner.nextInt(); // 求因数 for (int s = 2; s <= a; s++) { if (a % s == 0) { int j = 2; int k = (int) Math.sqrt(s);// i的平方根 for (j = 2; j <= k; j++) { if (a % j == 0) {// i:11 break; } } if (j > k) { arrayList.add(s); } } } int v = 1; for (Integer l : arrayList) { v *= l; } while (H(a, v)==1) { v = 1; for (Integer l : arrayList) { v *= l; } } Collections.sort(arrayList); int w=0; for (Integer z : arrayList) { w++; if (arrayList.size()==w) { System.out.println(z); }else { System.out.print(z+"*"); } } } public static int H(int n, int m) { int num = n / m; for (int s = 2; s <= num; s++) { if (num % s == 0) { int j = 2; int k = (int) Math.sqrt(s);// i的平方根 for (j = 2; j <= k; j++) { if (s % j == 0) {// i:11 break; } } if (j > k) { arrayList.add(s); return 1; } } } return 0; } }
0.0分
1 人评分