fork download
copy 
  1. import java.util.*;
  2. import java.io.*;
  3.  
  4. public class Main {
  5.     public static void main (String[]args)throws Exception{
  6.  
  7.         BufferedReader read = new BufferedReader(new InputStreamReader(System.in));
  8.  
  9.         long []Primes=new long[10000000];
  10.         Primes[0] = 2;
  11.         int i = 0,q=0,sum=0,t = Integer.parseInt(read.readLine());
  12.         boolean flag = true;
  13.         long start, end,c=2,tester,n,m,holder;
  14.         double root,root2;
  15.         long counter = 1;
  16.         String[] string;
  17.  
  18. while (counter<=t){
  19.      string = read.readLine().split(" ");
  20.      n = Long.parseLong(string[0]);
  21.      m = Long.parseLong(string[1]);
  22.      start = System.currentTimeMillis();
  23.  
  24.  
  25.      holder = n;
  26.      q = 0;
  27.      i = 0;
  28.      Primes[0] = 2;
  29.      c = 2;
  30.      flag = true;
  31.  
  32.         n = (int)Math.sqrt(1000000000);
  33.         if (holder == 1){
  34.             c++;
  35.             n = 2;
  36.             holder = 2;
  37.         }
  38.  
  39.  
  40.  
  41.  
  42.         while (c <= n){
  43.             root = (int)Math.sqrt(c);
  44.             while ( q <= i && Primes[q] <= root){
  45.                 tester = c % Primes[q];
  46.                 if (tester == 0){
  47.                     flag = false;
  48.                     break;   
  49.                 }
  50.                 q++;
  51.             }
  52.             if ( flag == true){
  53.                 Primes[i+1] = c;
  54.                 i++;
  55.             }
  56.             c++;
  57.             q = 0;
  58.             flag = true;   
  59.         }
  60.  
  61.         c = holder;
  62.         q = 0;
  63.         flag = true;
  64.         root = 0;
  65.  
  66.  
  67.  
  68.      while ( c < m){
  69.             root = Math.sqrt(c);
  70.             q = 0;
  71.         while (n <= root){
  72.                 while ( q <= i){
  73.                 tester = n % Primes[q];
  74.                 if (tester == 0){
  75.                     flag = false;
  76.                     break;   
  77.                 }
  78.                 q++;
  79.             }
  80.  
  81.             if ( flag == true){
  82.                 Primes[i+1] = n;
  83.                 i++;
  84.             }
  85.             q = 0;
  86.             flag = true;   
  87.             n++;
  88.         }
  89.         n = holder;
  90.         q = 0;
  91.            while ( q <= i && Primes[q] <= root){
  92.                if ( c == 2){
  93.                    System.out.println(c);
  94.                    sum++;
  95.                    flag = false;
  96.                }/*else if(c%2==0 || c%3==0||c%5==0){
  97.                    flag=false;
  98.                    break;
  99.                }
  100.                 
  101.                 * 
  102.                 */
  103.                else if ( c % Primes[q] == 0){
  104.                     flag = false;
  105.                     break;
  106.                 }
  107.                 q++;
  108.             }
  109.             if (flag == true){
  110.             System.out.println(c);
  111.             sum++;          
  112.             }
  113.             c++;
  114.             flag = true;
  115.             q = 0;
  116.             }
  117.             end = System.currentTimeMillis();
  118.             System.out.println("\nExecution time: " + (end-start) + " milliseconds.\n" + sum);
  119.     counter++;
  120.  
  121.  
  122.  
  123.  
  124.  
  125. }
  126. }
  127. }
  128.  
Runtime error #stdin #stdout 0.11s 212416KB
comments (?)
stdin
copy 
2
999900000 1000000000
1 100000
stdout
copy 
Standard output is empty
https://ideone.com/f3294
language:
Java (HotSpot 12)
created:
14 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!