-
Notifications
You must be signed in to change notification settings - Fork 0
/
Day_25_Solution.java
37 lines (34 loc) · 985 Bytes
/
Day_25_Solution.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
/**
* Title : Day_25_Solution.java
* Author : Tridib Samanta
* Created : 21-01-2020
* Link : https://www.hackerrank.com/challenges/30-running-time-and-complexity/problem
**/
import java.util.Scanner;
public class Day_25_Solution {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int T = scan.nextInt();
while (T-- > 0) {
int n = scan.nextInt();
System.out.println(isPrime(n) ? "Prime" : "Not prime");
}
scan.close();
}
private static boolean isPrime(int n) {
if (n < 2) {
return false;
} else if (n == 2) {
return true;
} else if (n % 2 == 0) {
return false;
}
int sqrt = (int) Math.sqrt(n);
for (int i = 3; i <= sqrt; i += 2) {
if (n % i == 0) {
return false;
}
}
return true;
}
}