FilesExpand file tree

 master

/

Day25Primes.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

43 lines (39 loc) · 921 Bytes

 master

/

Day25Primes.java

Copy path

Top

File metadata and controls

• Code
• Blame

43 lines (39 loc) · 921 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

38

39

40

41

42

43

package algorithms;

import java.util.Scanner;

class Day25Primes {

static boolean isPrime(int number){

boolean result = false;

if (number == 2){

result = true;

}else{

if (number < 2 || number % 2 == 0){

result = false;

}else{

if (Math.sqrt(number) % 1 == 0)

return false;

else{

result = true;

for (int i = 2; i < Math.sqrt(number); i++){

if (number % i == 0){

return false;

}

}

}

}

}

return result;

}

public static void main(String args[]){

/* Enter your code here.

* Read input from STDIN.

* Print output to STDOUT.

*/

Scanner scanner = new Scanner(System.in);

int trials = scanner.nextInt();

for (int i = 0; i < trials; i++){

int number = scanner.nextInt();

if (number >=1 && number < 2 * Math.pow(10, 9))

System.out.println(isPrime(number) ? "Prime" : "Not prime");

}

}

}