Advertisement
desislava_topuzakova

task10

Feb 20th, 2018
186
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.54 KB | None | 0 0
  1. import java.util.Scanner;
  2.  
  3. public class Problem10_CheckPrime {
  4. public static void main(String[] args) {
  5. Scanner scanner=new Scanner(System.in);
  6. int n = Integer.parseInt(scanner.nextLine());
  7. boolean prime = true;
  8. for (int i = 2; i <= Math.sqrt(n); i++) {
  9. if (n % i == 0 && n!=0) {
  10. prime = false;
  11. break;
  12. }
  13. }
  14. if (prime&&(n!=0&&n!=1)&&n>0) { System.out.println("Prime"); }
  15. else System.out.println("Not prime");
  16.  
  17. }
  18. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement