Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
PE #7
//Title of this code //'main' method must be in a class 'Rextester'. //Compiler version 1.8.0_45 import java.util.*; import java.lang.*; class Rextester { public static void main(String args[]) { int count = 4; for(int i=10; i<170000; i++) { if (isPrime(i)==true) { count++; System.out.print("("+count+", "+i+") "); //System.out.println("count up, "+count+", i: "+i); } //if ((count == 10001)&&(isPrime(i)==true)) { System.out.println("count: "+count+", i: "+i); } } // System.out.println("count: "+count); } public static boolean isPrime(int num) { int sqrnum = (int) Math.sqrt(num); boolean ans = true; if (num%2==0) { return false; } if (num%5==0) { return false; } if (num%3==0) { return false; } for (int i=3; i< sqrnum+1; i++) { if (num%i == 0) {ans = false; } } return ans; } }
run
|
edit
|
history
|
help
0
ArrayOperation
Fibonacci numbers 0 - 94
3e
Basic LinkedList in Java
Speed
JavaScript on Java's System.out.println()
Java Switch
Info by dfs
Problem: on_off
jb14.0 tests