素数距离问题

 1 import java.util.Scanner;
 2 
 3 public class Main {
 4     
 5     public static void main(String[] args) {
 6         
 7         Scanner sc=new Scanner(System.in);
 8         
 9         int times=sc.nextInt();
10         while(times-->0){
11             int n=sc.nextInt();
12             
13             if(isPrime(n)){
14                 System.out.println(n+" 0");
15                 continue;
16             }
17                 
18             int shift=1;
19 
20             while(true){
21                  if(isPrime(n-shift)){
22                         System.out.printf("%d %d\n",n-shift,shift);
23                         break;
24                  }else if(isPrime(n+shift)){
25                     System.out.printf("%d %d\n",n+shift,shift);
26                     break;
27                 }
28             }
29         }
30         
31     }
32     
33     public static boolean isPrime(int n){
34         for(int i=2,end=(int) Math.sqrt(n);i<=end;i++){
35             if(n%i==0) return false;
36         }
37         return true;
38     }
39 
40 }