Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public class P6.4 {
- public static void main(String[] args) {
- int m = Integer.parseInt(args[0]);
- boolean[] isPrime = new boolean[N + 1];
- for (int i = 2; i <= m; i++) {
- isPrime[i] = true}
- for (int i = 2; i*i <= m; i++) {
- if (isPrime[i]) {
- for (int j = i; i*j <= m; j++) {
- isPrime[i*j] = false;}
- }
- }
- int primes = 0;
- for (int i = 2; i <= m; i++) {
- if (isPrime[i]){ primes++; System.out.print(i+", ");}
- }
- System.out.println("\nThe number of primes <= " + N + " is " + primes);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement