Advertisement
Guest User

Untitled

a guest
Jan 18th, 2019
60
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.80 KB | None | 0 0
  1. import java.util.Scanner;
  2. public class Main
  3. {
  4. public static void main ( String [ ] args )
  5. {
  6. Scanner input = new Scanner(System.in);
  7. while(true)
  8. {
  9. System.out.println("Enter an integer greater than 1");
  10. int n = input.nextInt();
  11. int composites = 1;
  12. int[] nums = new int[n+1];
  13. for(int i = 0; i <= n; i++)
  14. {
  15. nums[i] = i;
  16. }
  17. for(int i = 2; i <= (Math.sqrt(n) + 1); i++)
  18. {
  19. for(int j = i*2; j <= n; j += i)
  20. {
  21. if(nums[j] != 0)
  22. {
  23. nums[j] = 0;
  24. composites++;
  25. }
  26. }
  27. }
  28. if(nums[n] != 0) composites++;
  29. int primes = n - composites;
  30. System.out.println("There are " + primes + " prime numbers below " + n + "\n");
  31. }
  32. }
  33. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement