September 2017 Update
This commit is contained in:
parent
bba7bfd280
commit
ba8067c3b7
14570 changed files with 153136 additions and 63871 deletions
|
|
@ -1,28 +1,27 @@
|
|||
public class AlmostPrime
|
||||
{
|
||||
public static void main(String args[])
|
||||
{
|
||||
public class AlmostPrime {
|
||||
public static void main(String[] args) {
|
||||
for (int k = 1; k <= 5; k++) {
|
||||
System.out.print("k = " + k + ":");
|
||||
|
||||
for (int i = 2, c = 0; c < 10; i++)
|
||||
for (int i = 2, c = 0; c < 10; i++) {
|
||||
if (kprime(i, k)) {
|
||||
System.out.print(" " + i);
|
||||
c++;
|
||||
}
|
||||
}
|
||||
|
||||
System.out.println("");
|
||||
}
|
||||
}
|
||||
|
||||
public static boolean kprime(int n, int k)
|
||||
{
|
||||
public static boolean kprime(int n, int k) {
|
||||
int f = 0;
|
||||
for (int p = 2; f < k && p*p <= n; p++)
|
||||
while (0 == n % p){
|
||||
n /= p;
|
||||
f++;
|
||||
for (int p = 2; f < k && p * p <= n; p++) {
|
||||
while (n % p == 0) {
|
||||
n /= p;
|
||||
f++;
|
||||
}
|
||||
return f + ((n > 1)?1:0) == k;
|
||||
}
|
||||
return f + ((n > 1) ? 1 : 0) == k;
|
||||
}
|
||||
}
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue