HDU 4715 Difference Between Primes (打表)

   Difference Between Primes

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 860 Accepted Submission(s): 278

Problem DescriptionInputOutputSample InputSample OutputSource

使用： BufferedReader bu=new BufferedReader(new InputStreamReader(System.in)); 和

PrintWriter pw=new PrintWriter(new OutputStreamWriter(System.out),true); 程序如下图

 

 

import java.io.*;import java.util.*;public class Main {int max=(int)Math.pow(10, 6)+10;boolean a[]=new boolean[max];public static void main(String[] args) throws IOException{new Main().work();}void work() throws IOException{BufferedReader bu=new BufferedReader(new InputStreamReader(System.in));PrintWriter pw=new PrintWriter(new OutputStreamWriter(System.out),true);isPrime();int n=Integer.parseInt(bu.readLine());while(n--!=0){int x=Integer.parseInt(bu.readLine());int m=x>0?x:Math.abs(x);boolean boo=true;int i=2;for(;i<max;i++){if(a[i+m]&&a[i]){boo=false;break;}}if(!boo){if(x>0)pw.println((i+m)+" "+i);elsepw.println(i+" "+(i+m));}elsepw.println("FAIL");}}//素数表void isPrime(){Arrays.fill(a,true);for(int i=2;i<max;i++){if(a[i]){for(int j=2*i;j<max;j+=i){a[j]=false;}}}}}