@@ -0,0 +1,875 @@
+package com.hackerrank.contests.daysOfCode_30;%0A%0Aimport java.util.Scanner;%0A%0A/**%0A * @author manishkumarmdb%0A *%0A */%0Apublic class Day25_RunningTimeAndComplexity %7B%0A%0A%09public static boolean isPrime(long number) %7B%0A%0A%09%09if (number %3C 2)%0A%09%09%09return false;%0A%09%09if (number == 2)%0A%09%09%09return true;%0A%09%09if (number %25 2 == 0)%0A%09%09%09return false;%0A%09%09for (long i = 3; (i * i) %3C= number; i += 2) %7B%0A%09%09%09if (number %25 i == 0)%0A%09%09%09%09return false;%0A%09%09%7D%0A%09%09return true;%0A%09%7D%0A%0A%09public static void main(String%5B%5D args) %7B%0A%09%09// TODO Auto-generated method stub%0A%0A%09%09@SuppressWarnings(%22resource%22)%0A%09%09Scanner scanner = new Scanner(System.in);%0A%09%09int T = scanner.nextInt();%0A%09%09while (T-- %3E 0) %7B%0A%09%09%09long N = scanner.nextInt();%0A%09%09%09if (N %3E= 1 && N %3C= (long) (2 * (Math.pow(10, 9)))) %7B%0A%09%09%09%09// print the number%0A%09%09%09%09if (isPrime(N)) %7B%0A%09%09%09%09%09System.out.println(%22Prime%22);%0A%09%09%09%09%7D else %7B%0A%09%09%09%09%09System.out.println(%22Not prime%22);%0A%09%09%09%09%7D%0A%0A%09%09%09%7D%0A%09%09%7D%0A%0A%09%7D%0A%0A%7D%0A

Create Day25_RunningTimeAndComplexity.java