Initial data commit
This commit is contained in:
parent
72d218235f
commit
f23f22d71c
199087 changed files with 3378941 additions and 0 deletions
37
Task/Parallel-calculations/Java/parallel-calculations.java
Normal file
37
Task/Parallel-calculations/Java/parallel-calculations.java
Normal file
|
|
@ -0,0 +1,37 @@
|
|||
import static java.lang.System.out;
|
||||
import static java.util.Arrays.stream;
|
||||
import static java.util.Comparator.comparing;
|
||||
|
||||
public interface ParallelCalculations {
|
||||
public static final long[] NUMBERS = {
|
||||
12757923,
|
||||
12878611,
|
||||
12878893,
|
||||
12757923,
|
||||
15808973,
|
||||
15780709,
|
||||
197622519
|
||||
};
|
||||
|
||||
public static void main(String... arguments) {
|
||||
stream(NUMBERS)
|
||||
.unordered()
|
||||
.parallel()
|
||||
.mapToObj(ParallelCalculations::minimalPrimeFactor)
|
||||
.max(comparing(a -> a[0]))
|
||||
.ifPresent(res -> out.printf(
|
||||
"%d has the largest minimum prime factor: %d%n",
|
||||
res[1],
|
||||
res[0]
|
||||
));
|
||||
}
|
||||
|
||||
public static long[] minimalPrimeFactor(long n) {
|
||||
for (long i = 2; n >= i * i; i++) {
|
||||
if (n % i == 0) {
|
||||
return new long[]{i, n};
|
||||
}
|
||||
}
|
||||
return new long[]{n, n};
|
||||
}
|
||||
}
|
||||
Loading…
Add table
Add a link
Reference in a new issue