1.欧拉算法求100以内素数个数
摘要:class test { private static boolean[] check = new boolean[101];//这里定100会有越界错误 private static int[] primeList = new int[101]; private static void euler
阅读全文
posted @ 2022-03-24 20:39
posted @ 2022-03-24 20:39