martinvalchev

Check Prime

Nov 24th, 2017
97
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Java 0.64 KB | None | 0 0
  1. import java.util.Scanner;
  2.  
  3. public class CheckPrime {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         int n = Integer.parseInt(scanner.nextLine());
  7.         boolean isPrime = true;
  8.  
  9.         for (int i = 2; i < n ; i++) {
  10.             if ( n % i == 0 ) {
  11.                 isPrime = false;
  12.                 break;
  13.             }
  14.         }
  15.         if ( n < 2 ) {
  16.             System.out.println("Not Prime");
  17.             return;
  18.         }
  19.         if (isPrime){
  20.             System.out.println("Prime");
  21.         } else {
  22.             System.out.println("Not Prime");
  23.         }
  24.     }
  25. }
Advertisement
Add Comment
Please, Sign In to add comment